Sciweavers

1871 search results - page 201 / 375
» The Ephemeral Pairing Problem
Sort
View
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
16 years 1 months ago
An evolutionary approach to constructive induction for link discovery
This paper presents a genetic programming-based symbolic regression approach to the construction of relational features in link analysis applications. Specifically, we consider t...
Tim Weninger, William H. Hsu, Jing Xia, Waleed Alj...
INFOCOM
2008
IEEE
16 years 1 months ago
Optimization Based Rate Control for Communication Networks with Inter-Session Network Coding
—In this paper we develop a distributed rate control algorithm for multiple-unicast-sessions when network coding is allowed. Building on our recent flow-based characterization o...
Abdallah Khreishah, Chih-Chun Wang, Ness B. Shroff
ISVD
2007
IEEE
16 years 26 days ago
From the Kneser-Poulsen conjecture to ball-polyhedra via Voronoi diagrams
A very fundamental geometric problem on finite systems of spheres was independently phrased by Kneser (1955) and Poulsen (1954). According to their well-known conjecture if a fi...
Károly Bezdek
ICCTA
2007
IEEE
16 years 25 days ago
Partially Dynamic Concurrent Update of Distributed Shortest Paths
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...
Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele ...
ICDCIT
2007
Springer
16 years 22 days ago
Self-stabilizing Routing Algorithms for Wireless Ad-Hoc Networks
This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the mess...
Rohit Ashok Khot, Ravikant Poola, Kishore Kothapal...