Sciweavers

108 search results - page 10 / 22
» A class of error-correcting pooling designs over complexes
Sort
View
IJCAI
2003
13 years 8 months ago
Towards Cooperative Negotiation for Decentralized Resource Allocation in Autonomic Computing Systems
Resource allocation is a key problem in autonomic computing. In this paper we use a data center scenario to motivate the need for decentralization and cooperative negotiation, and...
Craig Boutilier, Rajarshi Das, Jeffrey O. Kephart,...
CIE
2007
Springer
14 years 1 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
DLOG
2010
13 years 5 months ago
Checking Full Satisfiability of Conceptual Models
Abstract. UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constr...
Alessandro Artale, Diego Calvanese, Yazmin Ang&eac...
FLAIRS
1998
13 years 8 months ago
Analytical Design of Reinforcement Learning Tasks
Reinforcement learning (RL) problems constitute an important class of learning and control problems faced by artificial intelligence systems. In these problems, one is faced with ...
Robert E. Smith
PODS
2010
ACM
205views Database» more  PODS 2010»
14 years 14 days ago
Positive higher-order queries
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
Michael Benedikt, Gabriele Puppis, Huy Vu