Sciweavers

633 search results - page 77 / 127
» Locality and Hard SAT-Instances
Sort
View
CCCG
2004
13 years 11 months ago
Computing the set of all distant horizons of a terrain
We study the problem of computing the set of all distant horizons of a terrain, represented as either: the set of all edges that appear in the set of all distant horizons; the con...
William S. Evans, Daniel Archambault, David G. Kir...
FLAIRS
2006
13 years 11 months ago
Agile Sensor Networks: Adaptive Coverage via Mobile Nodes
Advances in sensing and communication technology make sensor networks a convenient and cost effective tool for collecting data in hard to reach and hazardous areas Increasingly, s...
Swapna Ghanekar, Fatma Mili, Imad Elhajj
ECSCW
2001
13 years 11 months ago
Decentralizing the control room: Mobile work and institutional order
This paper seeks to inform the ongoing redesign of air traffic management by examining current practices and the adoption of a new system aiming to relieve traffic control from wor...
Oskar Juhlin, Alexandra Weilenmann
ESM
2000
13 years 11 months ago
Filtered Gibbs sampler for estimating blocking probabilities in WDM optical networks
Blocking probabilities in Wavelength Division Multiplex optical networks are hard to compute for realistic sized systems, even though analytical formulas for the distribution exis...
Felisa J. Vázquez-Abad, Lachlan L. H. Andre...
CEC
2010
IEEE
13 years 11 months ago
Evolutionary multi-objective optimization algorithms with probabilistic representation based on pheromone trails
Abstract-- Recently, the research on quantum-inspired evolutionary algorithms (QEA) has attracted some attention in the area of evolutionary computation. QEA use a probabilistic re...
Hui Li, Dario Landa Silva, Xavier Gandibleux