Sciweavers

2373 search results - page 275 / 475
» Complexities for generalized models of self-assembly
Sort
View
SIGECOM
2006
ACM
138views ECommerce» more  SIGECOM 2006»
16 years 17 days ago
Bid expressiveness and clearing algorithms in multiattribute double auctions
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
Yagil Engel, Michael P. Wellman, Kevin M. Lochner
HICSS
2003
IEEE
127views Biometrics» more  HICSS 2003»
15 years 12 months ago
Testing Design of a Social Innovation The Environmental Mitigation Banking System
This paper attempts to evaluate the performance of an environmental mitigation banking system operating under different regulatory. Pricing and subsidization policies using system...
Khalid Saeed, Atsushi Fukuda
LICS
2000
IEEE
15 years 11 months ago
Automatic Structures
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
Achim Blumensath, Erich Grädel
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
15 years 10 months ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický
AAAI
2007
15 years 9 months ago
On the Partial Observability of Temporal Uncertainty
We explore a means to both model and reason about partial observability within the scope of constraintbased temporal reasoning. Prior studies of uncertainty in Temporal CSPs have ...
Michael D. Moffitt