Sciweavers

172 search results - page 21 / 35
» Planar Graphs with Topological Constraints
Sort
View
KR
2010
Springer
14 years 2 months ago
Finding the Next Solution in Constraint- and Preference-Based Knowledge Representation Formalisms
In constraint or preference reasoning, a typical task is to compute a solution, or an optimal solution. However, when one has already a solution, it may be important to produce th...
Ronen I. Brafman, Francesca Rossi, Domenico Salvag...
ACSC
2002
IEEE
14 years 2 months ago
Bandwidth Reservation Strategies for Mobility Support of Wireless Connections with QoS Guarantees
This paper examines QoS guarantees for bandwidth in mobile wireless networks, with a focus on reducing dropped connections on handoff. We can achieve this by reserving bandwidth f...
R. Hutchens, S. Singh
ICPR
2008
IEEE
14 years 4 months ago
Model-based visual self-localization using geometry and graphs
In this paper, a geometric approach for global selflocalization based on a world-model and active stereo vision is introduced. The method uses class specific object recognition a...
David Israel Gonzalez-Aguirre, Tamim Asfour, Eduar...
CORR
2011
Springer
215views Education» more  CORR 2011»
13 years 1 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
DNA
2006
Springer
126views Bioinformatics» more  DNA 2006»
14 years 1 months ago
On the Complexity of Graph Self-assembly in Accretive Systems
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
Stanislav Angelov, Sanjeev Khanna, Mirkó Vi...