Sciweavers

4865 search results - page 738 / 973
» The Complexity of Graph Connectivity
Sort
View
GECCO
2004
Springer
211views Optimization» more  GECCO 2004»
15 years 10 months ago
Node-Depth Encoding for Evolutionary Algorithms Applied to Network Design
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
Alexandre C. B. Delbem, André Carlos Ponce ...
MFCS
2004
Springer
15 years 9 months ago
A Protocol for Serializing Unique Strategies
Abstract. We devise an efficient protocol by which a series of twoperson games Gi with unique winning strategies can be combined into a single game G with unique winning strategy, ...
Marcel Crâsmaru, Christian Glaßer, Ken...
FOCS
2003
IEEE
15 years 9 months ago
On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
Timothy M. Chan
ICDAR
2003
IEEE
15 years 9 months ago
Detection, Extraction and Representation of Tables
We are concerned with the extraction of tables from exchange format representations of very diverse composite documents. We put forward a flexible representation scheme for comple...
Jean-Yves Ramel, Michel Crucianu, Nicole Vincent, ...
IPPS
2003
IEEE
15 years 9 months ago
Master-slave Tasking on Heterogeneous Processors
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
Pierre-François Dutot