Sciweavers

1763 search results - page 257 / 353
» A Formalization of Polytime Functions
Sort
View
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
14 years 10 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
IJFCS
2006
130views more  IJFCS 2006»
14 years 10 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
CSI
2007
89views more  CSI 2007»
14 years 10 months ago
Writing and executing ODP computational viewpoint specifications using Maude
The Reference Model of Open Distributed Processing (RM-ODP) is a joint standardization effort by ITU-T and ISO/IEC for the specification of large open distributed systems. RM-ODP ...
José Raúl Romero, Antonio Vallecillo...
SIMPRA
2008
131views more  SIMPRA 2008»
14 years 9 months ago
Distributed simulation of DEVS and Cell-DEVS models in CD++ using Web-Services
: DEVS is a Modeling and Simulation formalism that has been widely used to study the dynamics of discrete event systems. Cell-DEVS is a DEVS-based formalism that defines spatial mo...
Gabriel A. Wainer, Rami Madhoun, Khaldoon Al-Zoubi
SAC
2002
ACM
14 years 9 months ago
Semi-automatic design of agent organisations
Designing realistic multi-agent systems is a complex process, which involves specifying not only the functionality of individual agents, but also the authority relationships and l...
Anthony Karageorgos, Simon G. Thompson, Nikolay Me...