Sciweavers

1070 search results - page 145 / 214
» Benchmarking Adaptive Indexing
Sort
View
AAAI
2006
14 years 11 months ago
Memory Intensive Branch-and-Bound Search for Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sens...
Radu Marinescu 0002, Rina Dechter
IJCAI
1997
14 years 11 months ago
Understanding Three Simultaneous Speeches
Understanding three simultaneous speeches is proposed as a challenge problem to foster artificial intelligence, speech and sound understanding or recognition, and computational au...
Hiroshi G. Okuno, Tomohiro Nakatani, Takeshi Kawab...
CEC
2010
IEEE
14 years 11 months ago
Smart flight and dynamic tolerances in the artificial bee colony for constrained optimization
This paper presents an adaptation of a novel algorithm based on the foraging behavior of honey bees to solve constrained numerical optimization problems. The modifications focus on...
Efrén Mezura-Montes, Mauricio Damian-Araoz,...
ANOR
2008
171views more  ANOR 2008»
14 years 10 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
EOR
2010
133views more  EOR 2010»
14 years 10 months ago
A memetic algorithm for graph coloring
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
Zhipeng Lü, Jin-Kao Hao