Sciweavers

2398 search results - page 240 / 480
» Constraint Programming and Graph Algorithms
Sort
View
CADE
2009
Springer
16 years 7 months ago
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
Albert Rubio, Cristina Borralleras, Enric Rodr&iac...
ICALP
2007
Springer
16 years 20 days ago
Parameterized Approximability of the Disjoint Cycle Problem
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
Martin Grohe, Magdalena Grüber
IPMI
2005
Springer
16 years 7 months ago
Simultaneous Segmentation of Multiple Closed Surfaces Using Optimal Graph Searching
This paper presents a general graph-theoretic technique for simultaneously segmenting multiple closed surfaces in volumetric images, which employs a novel graph-construction scheme...
Kang Li, Steven Millington, Xiaodong Wu, Danny Z. ...
CORR
2008
Springer
96views Education» more  CORR 2008»
15 years 6 months ago
Improved Approximations for Multiprocessor Scheduling Under Uncertainty
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T...
GLOBECOM
2006
IEEE
16 years 17 days ago
Optimal Resource Allocation via Geometric Programming for OFDM Broadcast and Multiple Access Channels
Abstract— For multi-user orthogonal frequency division multiplexing (OFDM) systems, efficient optimal rate and power allocation algorithms are presented via geometric programmin...
Kibeom Seong, David D. Yu, Youngjae Kim, John M. C...