Sciweavers

352 search results - page 41 / 71
» Experimental Analysis of Approximation Algorithms for the Ve...
Sort
View
CPC
2006
110views more  CPC 2006»
13 years 7 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin
GECCO
2006
Springer
145views Optimization» more  GECCO 2006»
13 years 11 months ago
Immune anomaly detection enhanced with evolutionary paradigms
The paper presents an approach based on principles of immune systems to the anomaly detection problem. Flexibility and efficiency of the anomaly detection system are achieved by b...
Marek Ostaszewski, Franciszek Seredynski, Pascal B...
WCE
2007
13 years 8 months ago
A Distributed Energy Efficient Query Processing in Self-Organized Wireless Sensor Networks
—Spatial query execution is an essential functionality of a sensor network. Redundancy within a sensor network can be exploited to reduce the communication cost incurred in execu...
Meer A. Hamza, Sherin M. Youssef, Salma F. Fayed
SOFSEM
1997
Springer
13 years 11 months ago
Path Layout in ATM Networks
This paper surveys recent results in the area of virtual path layout in ATM networks. We present a model for the theoretical study of these layouts the model amounts to covering t...
Shmuel Zaks
PODC
2005
ACM
14 years 1 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer