Sciweavers

914 search results - page 116 / 183
» Branch and Bound on the Network Model
Sort
View
SPDP
1991
IEEE
15 years 1 months ago
Parallel and distributed algorithms for finite constraint satisfaction problems
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
Ying Zhang, Alan K. Mackworth
ANSS
2004
IEEE
15 years 1 months ago
Adaptive Energy Conservation Model using Dynamic Caching for Wireless Devices
One important issue that has to be taken into account in wireless devices is the energy conservation. Every infrastructureless network must be adaptively self configured particula...
Constandinos X. Mavromoustakis, Helen D. Karatza
INFOCOM
2003
IEEE
15 years 3 months ago
Modeling Malware Spreading Dynamics
— In this paper we present analytical techniques that can be used to better understand the behavior of malware, a generic term that refers to all kinds of malicious software prog...
Michele Garetto, Weibo Gong, Donald F. Towsley
MST
2002
169views more  MST 2002»
14 years 9 months ago
Bulk Synchronous Parallel Algorithms for the External Memory Model
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
Frank K. H. A. Dehne, Wolfgang Dittrich, David A. ...
ADHOCNOW
2004
Springer
15 years 3 months ago
Analysis of the Information Propagation Time Among Mobile Hosts
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
Tassos Dimitriou, Sotiris E. Nikoletseas, Paul G. ...