Sciweavers

7129 search results - page 31 / 1426
» Approximation Algorithms for Treewidth
Sort
View
AI
2005
Springer
14 years 9 months ago
First order LUB approximations: characterization and algorithms
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...
Alvaro del Val
JUCS
2007
137views more  JUCS 2007»
14 years 9 months ago
An Approach to Polygonal Approximation of Digital Curves Based on Discrete Particle Swarm Algorithm
: An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the poly...
Fangmin Dong, Renbin Xiao, Yifang Zhong, Yong Liu
JAIR
2008
171views more  JAIR 2008»
14 years 9 months ago
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models
Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Multi-Valued Decision Diagrams (MDD) with AND nodes, in order to capture function ...
Robert Mateescu, Rina Dechter, Radu Marinescu 0002
INFOCOM
2012
IEEE
13 years 4 days ago
Approximately optimal adaptive learning in opportunistic spectrum access
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
Cem Tekin, Mingyan Liu
INFOCOM
2012
IEEE
13 years 4 days ago
Approximate convex decomposition based localization in wireless sensor networks
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
Wenping Liu, Dan Wang, Hongbo Jiang, Wenyu Liu, Ch...