Sciweavers

14548 search results - page 16 / 2910
» The Optimal Path-Matching Problem
Sort
View
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
13 years 20 days ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
DPD
1998
117views more  DPD 1998»
13 years 9 months ago
Solving Local Cost Estimation Problem for Global Query Optimization in Multidatabase Systems
To meet users’ growing needs for accessing pre-existing heterogeneous databases, a multidatabase system (MDBS) integrating multiple databases has attracted many researchers recen...
Qiang Zhu, Per-Åke Larson
TPDS
2002
126views more  TPDS 2002»
13 years 9 months ago
P-3PC: A Point-to-Point Communication Model for Automatic and Optimal Decomposition of Regular Domain Problems
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
Frank J. Seinstra, Dennis Koelma
SIAMIS
2010
171views more  SIAMIS 2010»
13 years 4 months ago
Global Optimization for One-Dimensional Structure and Motion Problems
We study geometric reconstruction problems in one-dimensional retina vision. In such problems, the scene is modeled as a 2D plane, and the camera sensor produces 1D images of the s...
Olof Enqvist, Fredrik Kahl, Carl Olsson, Kalle &Ar...
SSPR
2010
Springer
13 years 8 months ago
Fast Population Game Dynamics for Dominant Sets and Other Quadratic Optimization Problems
We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of “players,” for finding dominant sets, a p...
Samuel Rota Bulò, Immanuel M. Bomze, Marcel...