1191 search results - page 171 / 239 » Completeness and Performance Of The APO Algorithm |
134
Voted
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
155
click to vote
ESA
1995
Springer
15 years 7 months ago
1995
Springer
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
158
Voted
CONSTRAINTS
2010
15 years 3 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
168
click to vote
SAC
2006
ACM
15 years 3 months ago
2006
ACM
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
122
click to vote
SEMWEB
2009
Springer
15 years 10 months ago
2009
Springer
State-of-the-art discovery of Semantic Web services is based on hybrid algorithms that combine semantic and syntactic matchmaking. These approaches are purely based on similarity m...