Sciweavers

1995 search results - page 340 / 399
» What's the Problem
Sort
View
155
Voted
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
15 years 8 months ago
Toward comparison-based adaptive operator selection
Adaptive Operator Selection (AOS) turns the impacts of the applications of variation operators into Operator Selection through a Credit Assignment mechanism. However, most Credit ...
Álvaro Fialho, Marc Schoenauer, Michè...
AGENTS
2001
Springer
15 years 8 months ago
Matchmaking among minimal agents without a facilitator
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
Elth Ogston, Stamatis Vassiliadis
143
Voted
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 8 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
161
Voted
ECAI
2000
Springer
15 years 8 months ago
Gaining Insights into Web Customers using Web Intelligence
The web is fast maturing into an important marketing medium that provides businesses with the ability to undertake oneto-one marketing and provide personalised services to their cu...
Sarabjot S. Anand, Matthias Baumgarten, Alex G. B&...
127
Voted
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 8 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund