Sciweavers

4451 search results - page 817 / 891
» On Random Ordering Constraints
Sort
View
GECCO
2005
Springer
159views Optimization» more  GECCO 2005»
14 years 2 months ago
Using evolutionary algorithms for the unit testing of object-oriented software
As the paradigm of object orientation becomes more and more important for modern IT development projects, the demand for an automated test case generation to dynamically test obje...
Stefan Wappler, Frank Lammermann
HPCC
2005
Springer
14 years 2 months ago
An Energy-Efficient Uni-scheduling Based on S-MAC in Wireless Sensor Network
S-MAC is a MAC (Medium Access Control) protocol as specialized for the wireless sensor network in order to sacrifice transmission delay and extend the working life of the whole sen...
Tae-Seok Lee, Yuan Yang, Ki-Jeong Shin, Myong-Soon...
ICALP
2005
Springer
14 years 2 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
ICALP
2005
Springer
14 years 2 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
IPSN
2005
Springer
14 years 2 months ago
Geographic routing with limited information in sensor networks
Geographic routing with greedy relaying strategies have been widely studied as a routing scheme in sensor networks. These schemes assume that the nodes have perfect information ab...
Sundar Subramanian, Sanjay Shakkottai