Sciweavers

667 search results - page 117 / 134
» Total parser combinators
Sort
View
ATAL
2007
Springer
14 years 3 months ago
On opportunistic techniques for solving decentralized Markov decision processes with temporal constraints
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
Janusz Marecki, Milind Tambe
HM
2007
Springer
137views Optimization» more  HM 2007»
14 years 3 months ago
A Hybrid VNS for Connected Facility Location
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
Ivana Ljubic
GMP
2006
IEEE
161views Solid Modeling» more  GMP 2006»
14 years 2 months ago
Tracking Point-Curve Critical Distances
This paper presents a novel approach to continuously and robustly tracking critical (geometrically, perpendicular and/or extremal) distances from a moving plane point p ∈ R2 to a...
Xianming Chen, Elaine Cohen, Richard F. Riesenfeld
INFOCOM
2006
IEEE
14 years 2 months ago
Complexity of Wavelength Assignment in Optical Network Optimization
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
Matthew Andrews, Lisa Zhang
ISCAS
2006
IEEE
145views Hardware» more  ISCAS 2006»
14 years 2 months ago
The wordlength determination problem of linear time invariant systems with multiple outputs - a geometric programming approach
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
S. C. Chan, K. M. Tsui