Sciweavers

728 search results - page 87 / 146
» Efficient Searching with Linear Constraints
Sort
View
CGF
2008
101views more  CGF 2008»
15 years 6 months ago
Spectral Conformal Parameterization
We present a spectral approach to automatically and efficiently obtain discrete free-boundary conformal parameterizations of triangle mesh patches, without the common artifacts du...
Patrick Mullen, Yiying Tong, Pierre Alliez, Mathie...
DAM
2010
120views more  DAM 2010»
15 years 6 months ago
A new approximation algorithm for the multilevel facility location problem
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren
AAMAS
2008
Springer
15 years 6 months ago
Using quantitative models to search for appropriate organizational designs
As the scale and scope of distributed and multi-agent systems grow, it becomes increasingly important to design and manage the participants' interactions. The potential for b...
Bryan Horling, Victor R. Lesser
SAT
2005
Springer
138views Hardware» more  SAT 2005»
15 years 11 months ago
On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization
The utilization of cutting planes is a key technique in Integer Linear Programming (ILP). However, cutting planes have seldom been applied in Pseudo-Boolean Optimization (PBO) algo...
Vasco M. Manquinho, João P. Marques Silva
NETCOOP
2007
Springer
16 years 5 days ago
A New Necessary Condition for Shortest Path Routing
In shortest path routing, traffic is routed along shortest paths defined by link weights. However, not all path systems are feasible in that they can be realized in this way. This...
Mats Petter Pettersson, Krzysztof Kuchcinski