Sciweavers

1086 search results - page 204 / 218
» Jug measuring: Algorithms and complexity
Sort
View
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 1 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
CLIMA
2007
14 years 11 months ago
Plan-Coordination Mechanisms and the Price of Autonomy
Abstract. Task-based planning problems for multi-agent systems require multiple agents to find a joint plan for a constrained set of tasks. Typically, each agent receives a subset...
J. Renze Steenhuisen, Cees Witteveen, Yingqian Zha...
SODA
2003
ACM
114views Algorithms» more  SODA 2003»
14 years 11 months ago
Lower bounds for collusion-secure fingerprinting
Collusion-secure fingerprinting codes are an important primitive used by many digital watermarking schemes [1, 10, 9]. Boneh and Shaw [3] define a model for these types of codes...
Chris Peikert, Abhi Shelat, Adam Smith
FLAIRS
1998
14 years 11 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
104
Voted
BMCBI
2010
149views more  BMCBI 2010»
14 years 9 months ago
A multifactorial analysis of obesity as CVD risk factor: Use of neural network based methods in a nutrigenetics context
Background: Obesity is a multifactorial trait, which comprises an independent risk factor for cardiovascular disease (CVD). The aim of the current work is to study the complex eti...
Ioannis K. Valavanis, Stavroula G. Mougiakakou, Ke...