Sciweavers

267 search results - page 49 / 54
» Efficient and decentralized computation of approximate globa...
Sort
View
COMPGEOM
2008
ACM
13 years 11 months ago
Maximum thick paths in static and dynamic environments
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
IPCO
2004
110views Optimization» more  IPCO 2004»
13 years 11 months ago
Scheduling an Industrial Production Facility
Managing an industrial production facility requires carefully allocating limited resources, and gives rise to large, potentially complicated scheduling problems. In this paper we c...
Eyjolfur Asgeirsson, Jonathan W. Berry, Cynthia A....
DAC
2002
ACM
14 years 10 months ago
Solving difficult SAT instances in the presence of symmetry
Research in algorithms for Boolean satisfiability and their efficient implementations [26, 8] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks fro...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
IWANN
2001
Springer
14 years 2 months ago
Is Neural Network a Reliable Forecaster on Earth? A MARS Query!
: Long-term rainfall prediction is a challenging task especially in the modern world where we are facing the major environmental problem of global warming. In general, climate and ...
Ajith Abraham, Dan Steinberg
HPDC
2003
IEEE
14 years 3 months ago
PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities
Abstract. We present PlanetP, a peer-to-peer (P2P) content search and retrieval infrastructure targeting communities wishing to share large sets of text documents. P2P computing is...
Francisco Matias Cuenca-Acuna, Christopher Peery, ...