Sciweavers

11740 search results - page 145 / 2348
» More Problems in Rewriting
Sort
View
EVOW
2008
Springer
15 years 2 months ago
Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem
This paper deals with the design of improved construction heuristics and iterated local search for the Routing and Wavelength Assignment problem (RWA). Given a physical network and...
Kerstin Bauer, Thomas Fischer, Sven Oliver Krumke,...
NIPS
2001
15 years 2 months ago
A Parallel Mixture of SVMs for Very Large Scale Problems
Support Vector Machines (SVMs) are currently the state-of-the-art models for many classication problems but they suer from the complexity of their training algorithm which is at l...
Ronan Collobert, Samy Bengio, Yoshua Bengio
IJCAI
2003
15 years 2 months ago
When Evolving Populations is Better than Coevolving Individuals: The Blind Mice Problem
This paper is about the evolutionary design of multi-agent systems. An important part of recent research in this domain has been focusing on collaborative revolutionary methods. W...
Thomas Miconi
IJCAI
1989
15 years 2 months ago
Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems
This paper presents an evaluation of two orthogonal schemes for improving the efficiency of solving constraint satisfaction problems (CSPs). The first scheme involves a class of p...
Rina Dechter, Itay Meiri
ORL
2008
99views more  ORL 2008»
15 years 27 days ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...