Sciweavers

6939 search results - page 670 / 1388
» Algorithm Engineering for Parallel Computation
Sort
View
RTSS
2005
IEEE
16 years 18 days ago
Enhanced EDF Scheduling Algorithms for Orchestrating Network-Wide Active Measurements
Monitoring network status such as end-to-end delay, jitter, and available bandwidth is important to support QoS-sensitive applications and timely detection of network anomalies li...
Prasad Calyam, Chang-Gun Lee, Phani Kumar Arava, D...
GECCO
2005
Springer
159views Optimization» more  GECCO 2005»
16 years 16 days 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
GECCO
2003
Springer
189views Optimization» more  GECCO 2003»
16 years 7 days ago
A Forest Representation for Evolutionary Algorithms Applied to Network Design
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...
Alexandre C. B. Delbem, André Carlos Ponce ...
HPDC
2005
IEEE
16 years 19 days ago
Dynamic load balancing for distributed search
This paper examines how computation can be mapped across the nodes of a distributed search system to effectively utilize available resources. We specifically address computationa...
Larry Huston, Alex Nizhner, Padmanabhan Pillai, Ra...
SIGCOMM
2004
ACM
16 years 13 days ago
Locating internet bottlenecks: algorithms, measurements, and implications
The ability to locate network bottlenecks along end-to-end paths on the Internet is of great interest to both network operators and researchers. For example, knowing where bottlen...
Ningning Hu, Erran L. Li, Zhuoqing Morley Mao, Pet...