Sciweavers

5244 search results - page 1042 / 1049
» When are two algorithms the same
Sort
View
COR
2007
80views more  COR 2007»
13 years 7 months ago
Scheduling with tool changes to minimize total completion time under controllable machining conditions
Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention...
M. Selim Akturk, Jay B. Ghosh, Rabia K. Kayan
IJSNET
2006
92views more  IJSNET 2006»
13 years 7 months ago
TTS: a two-tiered scheduling mechanism for energy conservation in wireless sensor networks
: In this paper, we present a two-tiered scheduling approach for effective energy conservation in wireless sensor networks. The effectiveness of this mechanism relies on dynamicall...
Nurcan Tezcan, Wenye Wang
DISOPT
2007
81views more  DISOPT 2007»
13 years 7 months ago
Strong polynomiality of resource constraint propagation
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation....
Luc Mercier, Pascal Van Hentenryck
ECCC
2007
90views more  ECCC 2007»
13 years 7 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
PAMI
2008
216views more  PAMI 2008»
13 years 7 months ago
Annotating Images by Mining Image Search Results
Although it has been studied for years by the computer vision and machine learning communities, image annotation is still far from practical. In this paper, we propose a novel atte...
Xin-Jing Wang, Lei Zhang 0001, Xirong Li, Wei-Ying...
« Prev « First page 1042 / 1049 Last » Next »