Sciweavers

566 search results - page 105 / 114
» Solution Reuse in Dynamic Constraint Satisfaction Problems
Sort
View
78
Voted
FGCS
2007
160views more  FGCS 2007»
14 years 9 months ago
Distributed data mining in grid computing environments
The computing-intensive data mining for inherently Internet-wide distributed data, referred to as Distributed Data Mining (DDM), calls for the support of a powerful Grid with an e...
Ping Luo, Kevin Lü, Zhongzhi Shi, Qing He
ICRA
2009
IEEE
116views Robotics» more  ICRA 2009»
14 years 7 months ago
Multi-vehicle path coordination in support of communication
Abstract-- This paper presents a framework for generating time-optimal velocity profiles for a group of pathconstrained vehicle robots that have fixed and known initial and goal lo...
Pramod Abichandani, Hande Y. Benson, Moshe Kam
105
Voted
ORL
2006
105views more  ORL 2006»
14 years 9 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
ICML
2010
IEEE
14 years 10 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
73
Voted
ICCAD
1995
IEEE
113views Hardware» more  ICCAD 1995»
15 years 1 months ago
Logic decomposition during technology mapping
—A problem in technology mapping is that the quality of the final implementation depends significantly on the initially provided circuit structure. This problem is critical, es...
Eric Lehman, Yosinori Watanabe, Joel Grodstein, He...