Sciweavers

110 search results - page 10 / 22
» Domains of Higher-Dimensional Automata
Sort
View
JAIR
2006
110views more  JAIR 2006»
13 years 8 months ago
Modelling Mixed Discrete-Continuous Domains for Planning
In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl...
Maria Fox, Derek Long
CADE
2002
Springer
14 years 9 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
CEC
2005
IEEE
14 years 2 months ago
Multiobjective clustering around medoids
Abstract- The large majority of existing clustering algorithms are centered around the notion of a feature, that is, individual data items are represented by their intrinsic proper...
Julia Handl, Joshua D. Knowles
DAGSTUHL
2010
13 years 10 months ago
Generalized Hyper-cylinders: a Mechanism for Modeling and Visualizing N-D Objects
The display of surfaces and solids has usually been restricted to the domain of scientific visualization; however, little work has been done on the visualization of surfaces and s...
Matthew O. Ward, Zhenyu Guo
IJCSA
2007
104views more  IJCSA 2007»
13 years 8 months ago
Solving the Satisfiability Problem Using Finite Learning Automata
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
Ole-Christoffer Granmo, Noureddine Bouhmala