Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Rainer Weigel

dblp:78/1540 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
0since 2021 · last 1999
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 4 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Planning, search and constraint satisfaction · 57% Efficient and distributed learning · 33% Knowledge representation and reasoning · 10%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

Topics — the 2 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
compilation
0.011999
Compiling constraint satisfaction problems · Artif. Intell. 1999
Machine learning › Efficient and distributed learning
resource allocation
0.011995
Abstraction by Interchangeability in Resource Allocation · IJCAI 1995

Methods — techniques the papers use, named apart from their topics

interchangeability · 0.0
YearPublicationVenuePosition
1999 Compiling constraint satisfaction problems
Rainer Weigel, Boi Faltings
Artif. Intell.1
1998 On Reformulation of Constraint Satisfaction Problems
Rainer Weigel, Christian Bliek
ECAI1
1998 Distributing problem solving on the Web using constraint technology
abstract
WWW servers have to serve many clients simultaneously and thus cannot provide intelligent services. We present an approach where intelligent problem solving is distributed so that compute-expensive tasks are carried out on the client side. To this end, we have implemented a library of constraint satisfaction techniques, called the JAVA constraint library, which allows composing applets that solve CSPs. We present the library and show several examples of applications.
Marc Torrens, Rainer Weigel, Boi Faltings
ICTAI2
1997 Structuring Techniques for Constraint Satisfaction Problems
Rainer Weigel, Boi Faltings
IJCAI (1)1
1996 Context in Discrete Constraint Satisfaction Problems
Rainer Weigel, Boi Faltings, Berthe Y. Choueiry
ECAI1
1995 Abstraction by Interchangeability in Resource Allocation
Berthe Y. Choueiry, Boi Faltings, Rainer Weigel
IJCAI3