Sciweavers

1464 search results - page 196 / 293
» Optimal Planning with ACO
Sort
View
VLDB
1997
ACM
142views Database» more  VLDB 1997»
14 years 1 months ago
Algorithms for Materialized View Design in Data Warehousing Environment
Selecting views to materialize is one of the most important decisions in designing a data warehouse. In this paper, we present a framework for analyzing the issues in selecting vi...
Jian Yang, Kamalakar Karlapalem, Qing Li
NIPS
2004
13 years 10 months ago
Coarticulation in Markov Decision Processes
We investigate an approach for simultaneously committing to multiple activities, each modeled as a temporally extended action in a semi-Markov decision process (SMDP). For each ac...
Khashayar Rohanimanesh, Robert Platt Jr., Sridhar ...
ACMDIS
2010
ACM
13 years 9 months ago
LumiBots: making emergence graspable in a swarm of robots
Emergence is a concept that is not easy to grasp, since it contradicts our idea of central control and planning. In this work, we use a swarm of robots as a tangible tool to visua...
Mey Lean Kronemann, Verena Vanessa Hafner
ESORICS
2010
Springer
13 years 9 months ago
Secure Multiparty Linear Programming Using Fixed-Point Arithmetic
Collaborative optimization problems can often be modeled as a linear program whose objective function and constraints combine data from several parties. However, important applicat...
Octavian Catrina, Sebastiaan de Hoogh
COR
2008
88views more  COR 2008»
13 years 9 months ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...