Sciweavers

8540 search results - page 214 / 1708
» The Dynamic Servers Problem
Sort
View
AIPS
1994
15 years 4 months ago
Solving Time-critical Decision-making Problems with Predictable Computational Demands
In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amountof time available for processing ...
Thomas Dean, Lloyd Greenwald
134
Voted
JSCIC
2010
136views more  JSCIC 2010»
14 years 10 months ago
Multiple Level Sets for Piecewise Constant Surface Reconstruction in Highly Ill-Posed Problems
This paper considers highly ill-posed surface recovery inverse problems, where the sought surface in 2D or 3D is piecewise constant with several possible level values. These level...
K. van den Doel, U. M. Ascher, A. Leitão
AIMSA
2008
Springer
15 years 9 months ago
Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...
Zhipeng Lü, Jin-Kao Hao
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
15 years 8 months ago
Transition models as an incremental approach for problem solving in evolutionary algorithms
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...
ICCV
1998
IEEE
15 years 7 months ago
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum- ow problem. Once solved, the minimum-cut associated ...
Sébastien Roy, Ingemar J. Cox