Sciweavers

1763 search results - page 163 / 353
» A Formalization of Polytime Functions
Sort
View
LISP
2008
104views more  LISP 2008»
15 years 4 months ago
Flattening tuples in an SSA intermediate representation
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
Lukasz Ziarek, Stephen Weeks, Suresh Jagannathan
AMAI
2004
Springer
15 years 4 months ago
Representing von Neumann-Morgenstern Games in the Situation Calculus
Sequential von Neumann-Morgernstern (VM) games are a very general formalism for representing multi-agent interactions and planning problems in a variety of types of environments. ...
Oliver Schulte, James P. Delgrande
KI
2007
Springer
15 years 4 months ago
Solving Decentralized Continuous Markov Decision Problems with Structured Reward
We present an approximation method that solves a class of Decentralized hybrid Markov Decision Processes (DEC-HMDPs). These DEC-HMDPs have both discrete and continuous state variab...
Emmanuel Benazera
CN
2002
111views more  CN 2002»
15 years 3 months ago
Analysis and optimisation of event-condition-action rules on XML
XML is a now a dominant standard for storing and exchanging information. With its increasing use in areas such as data warehousing and e-commerce, there is a rapidly growing need ...
James Bailey, Alexandra Poulovassilis, Peter T. Wo...
JUCS
2002
116views more  JUCS 2002»
15 years 3 months ago
Design for All as a Challenge for Hypermedia Engineering
: Design for All is an important challenge for hypermedia engineering. We analyze this challenge and show that it is necessary to find a way of describing partially designed hyperm...
Volker Mattick