Sciweavers

8695 search results - page 1684 / 1739
» Making the Complex Simple
Sort
View
CONEXT
2005
ACM
14 years 12 months ago
Location based placement of whole distributed systems
The high bandwidth and low latency of the modern internet has made possible the deployment of distributed computing platforms. The XenoServer platform provides a distributed compu...
David Spence, Jon Crowcroft, Steven Hand, Timothy ...
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
14 years 12 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
ER
2006
Springer
169views Database» more  ER 2006»
14 years 12 months ago
A More Expressive Softgoal Conceptualization for Quality Requirements Analysis
Initial software quality requirements tend to be imprecise, subjective, idealistic, and context-specific. An extended characterization of the common Softgoal concept is proposed fo...
Ivan Jureta, Stéphane Faulkner, Pierre-Yves...
COMPGEOM
2008
ACM
14 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...
CPAIOR
2008
Springer
14 years 11 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
« Prev « First page 1684 / 1739 Last » Next »