Sciweavers

20197 search results - page 3830 / 4040
» Comparing Computational Power
Sort
View
AI
2010
Springer
13 years 11 months ago
Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
AI
2008
Springer
13 years 11 months ago
Maintenance goals of agents in a dynamic environment: Formulation and policy construction
The notion of maintenance often appears in the AI literature in the context of agent behavior and planning. In this paper, we argue that earlier characterizations of the notion of...
Chitta Baral, Thomas Eiter, Marcus Bjäreland,...
AI
2007
Springer
13 years 11 months ago
An algorithm for distributing coalitional value calculations among cooperating agents
The process of forming coalitions of software agents generally requires calculating a value for every possible coalition which indicates how beneficial that coalition would be if...
Talal Rahwan, Nicholas R. Jennings
AUTOMATICA
2007
103views more  AUTOMATICA 2007»
13 years 11 months ago
Lexicographic perturbation for multiparametric linear programming with applications to control
Optimal control problems for constrained linear systems with a linear cost can be posed as multiparametric linear programs with a parameter in the cost, or equivalently the right-...
Colin Neil Jones, Eric C. Kerrigan, Jan M. Maciejo...
BMCBI
2010
148views more  BMCBI 2010»
13 years 11 months ago
Calling SNPs without a reference sequence
Background: The most common application for the next-generation sequencing technologies is resequencing, where short reads from the genome of an individual are aligned to a refere...
Aakrosh Ratan, Yu Zhang, Vanessa M. Hayes, Stephan...
« Prev « First page 3830 / 4040 Last » Next »