Sciweavers

4524 search results - page 582 / 905
» The Complexity of Global Constraints
Sort
View
ESA
2009
Springer
127views Algorithms» more  ESA 2009»
16 years 2 months ago
Maximum Flow in Directed Planar Graphs with Vertex Capacities
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
Haim Kaplan, Yahav Nussbaum
MATES
2009
Springer
16 years 2 months ago
GOAL as a Planning Formalism
Abstract. It has been observed that there are interesting relations between planning and agent programming. This is not surprising as agent programming was partially motivated by t...
Koen V. Hindriks, Tijmen Roberti
PPDP
2009
Springer
16 years 2 months ago
A declarative encoding of telecommunications feature subscription in SAT
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
Michael Codish, Samir Genaim, Peter J. Stuckey
GLOBECOM
2008
IEEE
16 years 2 months ago
Cross-Layer Design with Adaptive Modulation: Delay, Rate, and Energy Tradeoffs
— We present a crosslayer framework for optimizing the performance of wireless networks as measured by applications or upper layer protocols. The approach combines adaptive modul...
Daniel O'Neill, Andrea J. Goldsmith, Stephen P. Bo...
ICASSP
2008
IEEE
16 years 2 months ago
Distributed Kalman filtering based on quantized innovations
We consider state estimation of a Markov stochastic process using an ad hoc wireless sensor network (WSN) based on noisy linear observations. Due to power and bandwidth constraint...
Eric J. Msechu, Alejandro Ribeiro, Stergios I. Rou...