2976 search results - page 329 / 596 » On the bounded integer programming |
132
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fracti...
135
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
146
click to vote
LPAR
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...
135
click to vote
AIPS
2008
15 years 7 months ago
2008
We address the problem of coordinating the plans and schedules for a team of agents in an uncertain and dynamic environment. Bounded rationality, bounded communication, subjectivi...
132
click to vote
TIT
2002
15 years 4 months ago
2002
Abstract--We adapt methods originally developed in information and coding theory to solve some testing problems. The efficiency of two-stage pool testing of items is characterized ...