Sciweavers

3433 search results - page 122 / 687
» Heuristics for a bidding problem
Sort
View
ECAI
2000
Springer
15 years 10 months ago
Focusing Search by Using Problem Solving Experience
Case-based reasoning (CBR) aims at using experience from the past in order to guide future problem solving rather than “starting from scratch” every time. We propose a CBR stra...
Eyke Hüllermeier
AAAI
2011
14 years 6 months ago
The Steiner Multigraph Problem: Wildlife Corridor Design for Multiple Species
The conservation of wildlife corridors between existing habitat preserves is important for combating the effects of habitat loss and fragmentation facing species of concern. We in...
Katherine J. Lai, Carla P. Gomes, Michael K. Schwa...
AINA
2004
IEEE
15 years 10 months ago
On the Performance of Heuristic H MCOP for Multi-Constrained Optimal-Path QoS Routing
Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multip...
Gang Feng
HPCC
2011
Springer
14 years 6 months ago
Heuristic-Based Techniques for Mapping Irregular Communication Graphs to Mesh Topologies
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
Abhinav Bhatele, Laxmikant V. Kalé
SAT
2005
Springer
133views Hardware» more  SAT 2005»
15 years 12 months ago
Solving Over-Constrained Problems with SAT Technology
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà