Sciweavers

33356 search results - page 6278 / 6672
» Models of Continual Computation
Sort
View
HEURISTICS
1998
252views more  HEURISTICS 1998»
15 years 6 months ago
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...
P. C. Chu, J. E. Beasley
193
Voted
CGF
1999
126views more  CGF 1999»
15 years 6 months ago
A Shrink Wrapping Approach to Remeshing Polygonal Surfaces
Due to their simplicity and flexibility, polygonal meshes are about to become the standard representation for surface geometry in computer graphics applications. Some algorithms i...
Leif Kobbelt, Jens Vorsatz, Ulf Labsik, Hans-Peter...
JEI
2002
88views more  JEI 2002»
15 years 6 months ago
Natural image database and its use for scene illuminant estimation
This paper describes a database collecting natural color images, called the Natural Image Database, and shows how it is used for illuminant estimation problems. First, we present ...
Shoji Tominaga
DKE
1999
118views more  DKE 1999»
15 years 6 months ago
Designing Data Warehouses
A Data Warehouse DW is a database that collects and stores data from multiple remote and heterogeneous information sources. When a query is posed, it is evaluated locally, without...
Dimitri Theodoratos, Timos K. Sellis
ML
2002
ACM
143views Machine Learning» more  ML 2002»
15 years 6 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
« Prev « First page 6278 / 6672 Last » Next »