Sciweavers

509 search results - page 85 / 102
» On the completeness of compositional reasoning methods
Sort
View
ACMICEC
2006
ACM
111views ECommerce» more  ACMICEC 2006»
14 years 16 days ago
Passive verification of the strategyproofness of mechanisms in open environments
Consider an open infrastructure in which anyone can deploy mechanisms to support automated decision making and coordination amongst self-interested computational agents. Strategyp...
Laura Kang, David C. Parkes
ATAL
2006
Springer
14 years 16 days ago
Temporal qualitative coalitional games
Qualitative Coalitional Games (QCGs) are a version of coalitional games in which an agent's desires are represented as goals which are either satisfied or unsatisfied, and ea...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
SMA
1995
ACM
190views Solid Modeling» more  SMA 1995»
14 years 9 days ago
Creating solid models from single 2D sketches
We describe a method of constructing a B-rep solid model from a single hidden-line removed sketch view of a 3D object. The main steps of our approach are as follows. The sketch is...
Ian J. Grimstead, Ralph R. Martin
WSC
2008
13 years 11 months ago
Simulation optimization for industrial scheduling using hybrid genetic representation
Simulation modeling has the capability to represent complex real-world systems in details and therefore it is suitable to develop simulation models for generating detailed operati...
Marcus Andersson, Amos Ng, Henrik Grimm
ASPDAC
2005
ACM
120views Hardware» more  ASPDAC 2005»
13 years 10 months ago
STACCATO: disjoint support decompositions from BDDs through symbolic kernels
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...
Stephen Plaza, Valeria Bertacco