Sciweavers

336 search results - page 54 / 68
» Consultant-guided search algorithms for the quadratic assign...
Sort
View
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
14 years 13 days ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
WWW
2008
ACM
14 years 9 months ago
Matching independent global constraints for composite web services
Service discovery employs matching techniques to select services by comparing their descriptions against user constraints. Semantic-based matching approaches achieve higher recall...
Nalaka Gooneratne, Zahir Tari
CIVR
2009
Springer
212views Image Analysis» more  CIVR 2009»
14 years 3 months ago
Video copy detection by fast sequence matching
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
Mei-Chen Yeh, Kwang-Ting Cheng
ATAL
2009
Springer
14 years 3 months ago
Evaluating hybrid constraint tightening for scheduling agents
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...
James C. Boerkoel Jr., Edmund H. Durfee
IAT
2009
IEEE
14 years 3 months ago
Distributed Constraint Optimization for Large Teams of Mobile Sensing Agents
Abstract. A team of mobile sensors can be used for coverage of targets in different environments. The dynamic nature of such an application requires the team of agents to adjust th...
Roie Zivan, Robin Glinton, Katia P. Sycara