Sciweavers

14518 search results - page 28 / 2904
» Two Problems for Sophistication
Sort
View
AAAI
2008
13 years 10 months ago
Minimizing Disk I/O in Two-Bit Breadth-First Search
We present a breadth-first search algorithm, two-bit breadthfirst search (TBBFS), which requires only two bits for each state in the problem space. TBBFS can be parallelized in se...
Richard E. Korf
GECCO
2008
Springer
199views Optimization» more  GECCO 2008»
13 years 8 months ago
Analysis of multi-objective evolutionary algorithms to optimize dynamic data types in embedded systems
New multimedia embedded applications are increasingly dynamic, and rely on Dynamically-allocated Data Types (DDTs) to store their data. The optimization of DDTs for each target em...
José Ignacio Hidalgo, José L. Risco-...
ESA
2010
Springer
179views Algorithms» more  ESA 2010»
13 years 7 months ago
On Space Efficient Two Dimensional Range Minimum Data Structures
The two dimensional range minimum query problem is to preprocess a static two dimensional m by n array A of size N = m
Gerth Stølting Brodal, Pooya Davoodi, S. Sr...
EOR
2007
198views more  EOR 2007»
13 years 7 months ago
Airline crew scheduling from planning to operations
Crew scheduling problems at the planning level are typically solved in two steps: first, creating working patterns, and then assigning these to individual crew. The first step is ...
Claude P. Medard, Nidhi Sawhney
ICLP
1999
Springer
13 years 12 months ago
Logic Programming in Oz with Mozart
Oz is a multiparadigm language that supports logic programming as one of its major paradigms. A multiparadigm language is designed to support different programming paradigms (log...
Peter Van Roy