Sciweavers

849 search results - page 94 / 170
» Search allocation game
Sort
View
HM
2009
Springer
145views Optimization» more  HM 2009»
15 years 4 months ago
Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows
Abstract. In this work we extend a VNS for the periodic vehicle routing problem with time windows (PVRPTW) to a multiple VNS (mVNS) where several VNS instances are applied cooperat...
Sandro Pirkwieser, Günther R. Raidl
ETRA
2000
ACM
102views Biometrics» more  ETRA 2000»
15 years 4 months ago
Evaluating variable resolution displays with visual search: task performance and eye movements
Gaze-contingent variable resolution display techniques allocate computational resources for image generation preferentially to the area around the center of gaze where visual sens...
Derrick Parkhurst, Eugenio Culurciello, Ernst Nieb...
COR
2010
127views more  COR 2010»
14 years 12 months ago
Discrepancy search for the flexible job shop scheduling problem
The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a f...
Abir Ben Hmida, Mohamed Haouari, Marie-José...
CDC
2010
IEEE
14 years 7 months ago
Cost-aware Bayesian sequential decision-making for domain search and object classification
This paper focuses on the development of a cost-aware Bayesian sequential decision-making strategy for the search and classification of multiple unknown objects over a given domain...
Yue Wang, Islam I. Hussein, Donald R. Brown, Richa...
AAAI
2010
15 years 1 months ago
Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
Akihiro Kishimoto