Sciweavers

3229 search results - page 535 / 646
» The Theory of Timed Automata
Sort
View
JEI
2007
144views more  JEI 2007»
15 years 5 months ago
Cost-based closed-contour representations
This paper presents an efficient technique for linking edge points in order to generate a closed-contour representation. It is based on the consecutive use of global and local sch...
Angel Domingo Sappa, Boris Xavier Vintimilla
CG
2005
Springer
15 years 5 months ago
A new algorithm for Boolean operations on general polygons
A new algorithm for Boolean operations on general planar polygons is presented. It is available for general planar polygons (manifold or non-manifold, with or without holes). Edge...
Yu Peng, Jun-Hai Yong, Wei-Ming Dong, Hui Zhang, J...
JNCA
2007
69views more  JNCA 2007»
15 years 5 months ago
Specifying the intertwining of cooperation and autonomy in agent-based systems
Cooperation and autonomy are two antagonistic core variables of agent-based systems, and a key challenge in designing such systems is to balance these variables appropriately. Thi...
Gerhard Weiß, Matthias Nickles, Michael Rova...
TSP
2008
166views more  TSP 2008»
15 years 5 months ago
Nonuniform Sampling of Periodic Bandlimited Signals
Abstract--Digital processing techniques are based on representing a continuous-time signal by a discrete set of samples. This paper treats the problem of reconstructing a periodic ...
E. Margolis, Yonina C. Eldar
AI
2004
Springer
15 years 5 months ago
ASSAT: computing answer sets of a logic program by SAT solvers
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
Fangzhen Lin, Yuting Zhao