Sciweavers

74 search results - page 10 / 15
» On Programs with Linearly Ordered Multiple Preferences
Sort
View
CORR
2000
Springer
120views Education» more  CORR 2000»
13 years 7 months ago
Scaling Up Inductive Logic Programming by Learning from Interpretations
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming ...
Hendrik Blockeel, Luc De Raedt, Nico Jacobs, Bart ...
AI
2002
Springer
13 years 7 months ago
Using similarity criteria to make issue trade-offs in automated negotiations
Automated negotiation is a key form of interaction in systems that are composed of multiple autonomous agents. The aim of such interactions is to reach agreements through an itera...
Peyman Faratin, Carles Sierra, Nicholas R. Jenning...
CORR
2008
Springer
162views Education» more  CORR 2008»
13 years 7 months ago
Welfare Undominated Groves Mechanisms
A common objective in mechanism design is to choose the outcome (for example, allocation of resources) that maximizes the sum of the agents' valuations, without introducing in...
Krzysztof R. Apt, Vincent Conitzer, Mingyu Guo, Ev...
ENDM
2006
69views more  ENDM 2006»
13 years 7 months ago
Timetabling problems at the TU Eindhoven
The students of the Industrial Design department at the TU Eindhoven are allowed to design part of their curriculum by selecting courses from a huge course pool. They do this by ha...
John van den Broek, Cor A. J. Hurkens, Gerhard J. ...
LCTRTS
2005
Springer
14 years 1 months ago
A dictionary construction technique for code compression systems with echo instructions
Dictionary compression mechanisms identify redundant sequences of instructions that occur in a program. The sequences are extracted and copied to a dictionary. Each sequence is th...
Philip Brisk, Jamie Macbeth, Ani Nahapetian, Majid...