Sciweavers

3320 search results - page 378 / 664
» Heuristics for the Phylogeny Problem
Sort
View
EOR
2006
87views more  EOR 2006»
15 years 6 months ago
Applying machine based decomposition in 2-machine flow shops
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...
Saral Mukherjee, A. K. Chatterjee
JAIR
2008
145views more  JAIR 2008»
15 years 6 months ago
Communication-Based Decomposition Mechanisms for Decentralized MDPs
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
Claudia V. Goldman, Shlomo Zilberstein
RAS
2006
134views more  RAS 2006»
15 years 6 months ago
Simultaneous planning, localization, and mapping in a camera sensor network
In this paper we examine issues of localization, exploration, and planning in the context of a hybrid robot/camera-network system. We exploit the ubiquity of camera networks to us...
Ioannis M. Rekleitis, David Meger, Gregory Dudek
INFORMATICALT
2007
76views more  INFORMATICALT 2007»
15 years 6 months ago
An Integrative Framework to Protocol Analysis and Repair: Bellare-Rogaway Model + Planning + Model Checker
A modified version of the Bellare and Rogaway (1993) adversarial model is encoded using Asynchronous Product Automata (APA). A model checker tool, Simple Homomorphism Verificatio...
Kim-Kwang Raymond Choo
DKE
2002
107views more  DKE 2002»
15 years 6 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias