Sciweavers

1760 search results - page 290 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
NAACL
2007
13 years 9 months ago
Combining Probability-Based Rankers for Action-Item Detection
This paper studies methods that automatically detect action-items in e-mail, an important category for assisting users in identifying new tasks, tracking ongoing ones, and searchi...
Paul N. Bennett, Jaime G. Carbonell
ESANN
2003
13 years 9 months ago
Improving iterative repair strategies for scheduling with the SVM
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
Kai Gersmann, Barbara Hammer
EOR
2007
117views more  EOR 2007»
13 years 7 months ago
Considering manufacturing cost and scheduling performance on a CNC turning machine
A well known industry application that allows controllable processing times is the manufacturing operations on CNC machines. For each turning operation as an example, there is a n...
Sinan Gurel, M. Selim Akturk
TON
1998
68views more  TON 1998»
13 years 7 months ago
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
Abstract—The total transmission capacity required by a transport network to satisfy demand and protect it from failures contributes significantly to its cost, especially in long...
Rainer R. Iraschko, Mike H. MacGregor, Wayne D. Gr...
ICRA
2010
IEEE
129views Robotics» more  ICRA 2010»
13 years 6 months ago
Improving mutual information-based visual servoing
— In a previous paper [3], we proposed a new way to achieve visual servoing. Rather than minimizing the error between the position of two set of geometric features, we proposed t...
Amaury Dame, Éric Marchand