Sciweavers

29046 search results - page 5412 / 5810
» Computable Models
Sort
View
160
Voted
DAM
1998
77views more  DAM 1998»
15 years 6 months ago
The Scheduling of Maintenance Service
We study a discrete problem of scheduling activities of several types under the constraint that at most a single activity can be scheduled to any one period. Applications of such ...
Shoshana Anily, Celia A. Glass, Refael Hassin
183
Voted
ENTCS
1998
101views more  ENTCS 1998»
15 years 6 months ago
A Fully Abstract Metric-Space Denotational Semantics for Reactive Probabilistic Processes
Abstract Metric-Space Denotational Semantics for Reactive Probabilistic Processes M.Z. Kwiatkowska and G.J. Norman School of Computer Science, University of Birmingham, Edgbaston, ...
Marta Z. Kwiatkowska, Gethin Norman
166
Voted
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
189
Voted
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 5412 / 5810 Last » Next »