388 search results - page 59 / 78 » A Mixed Closure-CSP Method to Solve Scheduling Problems |
110
click to vote
JDCTA
2010
14 years 8 months ago
2010
A novel breadth-first based structural clustering method for graphs is proposed. Clustering is an important task for analyzing complex networks such as biological networks, World ...
121
click to vote
AAMAS
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We present a novel logic-based framework to automate multi-issue bilateral negotiation in e-commerce settings. The approach exploits logic as communication language among...
119
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
The paper deals with optimization of collective communications on multistage interconnection networks (MINs). In the experimental work, unidirectional MINs like Omega, Butterfly a...
121
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...
106
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
The AI optimization algorithm called "Squeaky-Wheel Optimization" (SWO) has proven very effective in a variety of real-world applications. Although the ideas behind SWO ...