Sciweavers

2738 search results - page 155 / 548
» The Frobenius Problem and Its Generalizations
Sort
View
ESA
2004
Springer
105views Algorithms» more  ESA 2004»
15 years 10 months ago
Time Dependent Multi Scheduling of Multicast
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
Rami Cohen, Dror Rawitz, Danny Raz
ATAL
2003
Springer
15 years 9 months ago
Multiagent diffusion and distributed optimization
Distributed problem solving by a multiagent system represents a promising approach to solving complex computational problems. However, many multiagent systems require certain degr...
Kwok Ching Tsui, Jiming Liu
FSTTCS
2001
Springer
15 years 9 months ago
Semidefinite Programming Based Approximation Algorithms
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
Uri Zwick
FOCS
2004
IEEE
15 years 8 months ago
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
Lap Chi Lau
COMPGEOM
2001
ACM
15 years 8 months ago
PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation
: Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitive...
Shankar Krishnan, Mark Foskey, Tim Culver, John Ke...