Sciweavers

898 search results - page 158 / 180
» Transitions of the Pre-Symmetry Set
Sort
View
ENTCS
2006
173views more  ENTCS 2006»
13 years 9 months ago
Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
Tobe Toben, Bernd Westphal
IJPRAI
2008
144views more  IJPRAI 2008»
13 years 9 months ago
Unsupervised Learning of a Hierarchy of Topological Maps Using Omnidirectional Images
unsupervised construction of topological maps, which provide an abstraction of the environment in terms of visual aspects. An unsupervised clustering algorithm is used to represent...
Ales Stimec, Matjaz Jogan, Ales Leonardis
CL
2007
Springer
13 years 9 months ago
Skeleton-based parallel programming: Functional and parallel semantics in a single shot
Semanticsofskeleton-basedparallelprogramminglanguagescomesusuallyastwodistinctitems:afunctionalsemantics,modeling the function computed by the skeleton program, and a parallel sem...
Marco Aldinucci, Marco Danelutto
IGPL
2006
87views more  IGPL 2006»
13 years 9 months ago
Satisfiability Decay along Conjunctions of Pseudo-Random Clauses
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
Eli Shamir
JAIR
2008
98views more  JAIR 2008»
13 years 9 months ago
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
Menkes Hector Louis van den Briel, Thomas Vossen, ...