5624 search results - page 645 / 1125 » On Conditional Covering Problem |
149
click to vote
CGO
2003
IEEE
15 years 11 months ago
2003
IEEE
Predicated execution can eliminate hard to predict branches and help to enable instruction level parallelism. Many current predication variants exist where the result update is co...
156
click to vote
PODC
1999
ACM
15 years 10 months ago
1999
ACM
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in th...
147
click to vote
WDAG
1989
Springer
15 years 10 months ago
1989
Springer
We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability ...
167
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
The VCG mechanism is the canonical method for motivating bidders in combinatorial auctions and exchanges to bid truthfully. We study two related problems concerning the VCG mechan...
180
click to vote
AIPS
2006
15 years 7 months ago
2006
Recent research in AI Planning is focused on improving the quality of the generated plans. PDDL3 incorporates hard and soft constraints on goals and the plan trajectory. Plan traj...