200 search results - page 26 / 40 » On the decidability of phase ordering problem in optimizing ... |
147
Voted
COCOA
2009
Springer
15 years 11 months ago
2009
Springer
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivati...
120
click to vote
COCOA
2007
Springer
15 years 11 months ago
2007
Springer
This paper attends to the problem of a mechanism designer seeking to influence the outcome of a strategic game based on her creditability. The mechanism designer offers additional...
131
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
164
click to vote
IEEEPACT
2002
IEEE
15 years 10 months ago
2002
IEEE
Modern embedded systems often require high degrees of instruction-level parallelism (ILP) within strict constraints on power consumption and chip cost. Unfortunately, a high-perfo...
129
click to vote
ICRA
2010
IEEE
15 years 3 months ago
2010
IEEE
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...