Sciweavers

1725 search results - page 325 / 345
» Relaxed genetic programming
Sort
View
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 10 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
SIGMOD
2006
ACM
126views Database» more  SIGMOD 2006»
14 years 10 months ago
Declarative networking: language, execution and optimization
The networking and distributed systems communities have recently explored a variety of new network architectures, both for applicationlevel overlay networks, and as prototypes for...
Boon Thau Loo, Tyson Condie, Minos N. Garofalakis,...
MOBIHOC
2006
ACM
14 years 9 months ago
Distributed localization using noisy distance and angle information
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Giri...
SODA
2010
ACM
189views Algorithms» more  SODA 2010»
14 years 7 months ago
Correlation Clustering with Noisy Input
Correlation clustering is a type of clustering that uses a basic form of input data: For every pair of data items, the input specifies whether they are similar (belonging to the s...
Claire Mathieu, Warren Schudy
HYBRID
2010
Springer
14 years 4 months ago
Automatic invariant generation for hybrid systems using ideal fixed points
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
Sriram Sankaranarayanan