Sciweavers

1557 search results - page 178 / 312
» Programming up to Congruence
Sort
View
AAAI
1996
15 years 19 days ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
Craig Boutilier, David Poole
LMO
1996
15 years 18 days ago
Using Metaobjects to Model Concurrent Objects with PICT
We seek to support the development of open, distributed applications from patible software abstractions. In order to rigorously specify these abstractions, we are elaborating a for...
Markus Lumpe, Jean-Guy Schneider, Oscar Nierstrasz
CORR
2008
Springer
102views Education» more  CORR 2008»
14 years 11 months ago
Spreadsheet modelling for solving combinatorial problems: The vendor selection problem
Spreadsheets have grown up and became very powerful and easy to use tools in applying analytical techniques for solving business problems. Operations managers, production managers...
Pandelis G. Ipsilandis
ENTCS
2006
118views more  ENTCS 2006»
14 years 11 months ago
The Language Evolver Lever - Tool Demonstration -
Since many domains are constantly evolving, the associated domain specific languages (DSL) inevitably have to evolve too, to retain their value. But the evolution of a DSL can be ...
Elmar Jürgens, Markus Pizka
IJFCS
2006
111views more  IJFCS 2006»
14 years 11 months ago
Completeness and realizability: conditions for automatic generation of workflows
In recent years, workflow technology has greatly facilitated business process modeling and reengineering in information systems. On one hand, the separation of an application'...
Shiyong Lu, Arthur J. Bernstein, Philip M. Lewis