Sciweavers

2657 search results - page 45 / 532
» On the complexity of hierarchical problem solving
Sort
View
ICCS
2009
Springer
15 years 8 months ago
Simulating Individual-Based Models of Epidemics in Hierarchical Networks
Current mathematical modeling methods for the spreading of infectious diseases are too simplified and do not scale well. We present the Simulator of Epidemic Evolution in Complex ...
Rick Quax, David A. Bader, Peter M. A. Sloot
CP
2007
Springer
15 years 7 months ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner
DATE
2008
IEEE
128views Hardware» more  DATE 2008»
15 years 7 months ago
Robust and Low Complexity Rate Control for Solar Powered Sensors
This paper is concerned with solar driven sensors deployed in an outdoor environment. We present feedback controllers which adapt parameters of the application such that a maximal...
Clemens Moser, Lothar Thiele, Davide Brunelli, Luc...
IPPS
2010
IEEE
14 years 11 months ago
Large scale complex network analysis using the hybrid combination of a MapReduce cluster and a highly multithreaded system
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
Seunghwa Kang, David A. Bader
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
15 years 8 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl