Sciweavers

8695 search results - page 433 / 1739
» Making the Complex Simple
Sort
View
ICCS
2003
Springer
16 years 26 days ago
Measurement Models for Survivability and Competitiveness of Very Large E-marketplace
E-Marketplace is a man-made profit center with emergent customer requirements. This emergence nature poses many difficulties for e-marketplace to satisfy its customers and thus aff...
Jingzhi Guo, Chengzheng Sun
IDA
2003
Springer
16 years 25 days ago
Guided Incremental Construction of Belief Networks
Because uncertain reasoning is often intractable, it is hard to reason with a large amount of knowledge. One solution to this problem is to specify a set of possible models, some s...
Charles A. Sutton, Brendan Burns, Clayton T. Morri...
FUN
2010
Springer
251views Algorithms» more  FUN 2010»
16 years 13 days ago
UNO Is Hard, Even for a Single Player
UNOR is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise ma...
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara,...
CC
2001
Springer
177views System Software» more  CC 2001»
16 years 4 days ago
Imperative Program Transformation by Rewriting
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
David Lacey, Oege de Moor
LICS
2000
IEEE
16 years 22 hour ago
The Role of Decidability in First Order Separations over Classes of Finite Structures
We establish that the decidability of the first order theory of a class of finite structures ¢ is a simple and useful condition for guaranteeing that the expressive power of FO...
Steven Lindell, Scott Weinstein