Sciweavers

10392 search results - page 2030 / 2079
» Introduction to Computer Science
Sort
View
GECCO
2003
Springer
189views Optimization» more  GECCO 2003»
14 years 4 months 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 ...
ICALP
2003
Springer
14 years 4 months ago
Algorithmic Aspects of Bandwidth Trading
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph ...
ICALP
2003
Springer
14 years 4 months ago
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
COMPGEOM
2010
ACM
14 years 4 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
VL
2002
IEEE
165views Visual Languages» more  VL 2002»
14 years 3 months ago
Co-Ordination of Multiple External Representations during Java Program Debugging
Java program debugging was investigated in computer science students who used a software debugging environment (SDE) that provided concurrently displayed, adjacent, multiple and l...
Pablo Romero, Rudi Lutz, Richard Cox, Benedict du ...
« Prev « First page 2030 / 2079 Last » Next »