Sciweavers

4432 search results - page 655 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
ESA
2008
Springer
136views Algorithms» more  ESA 2008»
15 years 4 months ago
Detecting Regular Visit Patterns
We are given a trajectory T and an area A. T might intersect A several times, and our aim is to detect whether T visits A with some regularity, e.g. what is the longest time span t...
Bojan Djordjevic, Joachim Gudmundsson, Anh Pham, T...
SODA
2008
ACM
156views Algorithms» more  SODA 2008»
15 years 4 months ago
Approximating TSP on metrics with bounded global growth
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
T.-H. Hubert Chan, Anupam Gupta
DLOG
2006
15 years 4 months ago
On the Scalability of Description Logic Instance Retrieval
Abstract Practical description logic systems play an ever-growing role for knowledge representation and reasoning research even in distributed environments. In particular, the onto...
Ralf Möller, Volker Haarslev, Michael Wessel
AAAI
1998
15 years 4 months ago
An Integer Local Search Method with Application to Capacitated Production Planning
Production planning is an important task in manufacturing systems. We consider a real-world capacitated lot-sizing problem (CLSP) from the process industry. Because the problem re...
Joachim P. Walser, Ramesh Iyer, Narayan Venkatasub...
AUTOMATICA
2008
134views more  AUTOMATICA 2008»
15 years 3 months ago
Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...