Sciweavers

1450 search results - page 100 / 290
» On the Complexity of Hardness Amplification
Sort
View
AAMAS
2007
Springer
13 years 9 months ago
A formal framework for connective stability of highly decentralized cooperative negotiations
Abstract. Multiagent cooperative negotiation is a promising technique for modeling and controlling complex systems. Effective and flexible cooperative negotiations are especially...
Francesco Amigoni, Nicola Gatti
AIR
2006
107views more  AIR 2006»
13 years 9 months ago
Just enough learning (of association rules): the TAR2 "Treatment" learner
Abstract. An over-zealous machine learner can automatically generate large, intricate, theories which can be hard to understand. However, such intricate learning is not necessary i...
Tim Menzies, Ying Hu
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
13 years 9 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
GRID
2006
Springer
13 years 9 months ago
Monitoring and analysing a Grid Middleware Node
Distributed Grid applications are becoming more and more popular as the use of complex grid middlewares becomes extensive, and more facilities are offered by these complex pieces o...
Ramon Nou, Ferran Julià, David Carrera, Kev...
FSTTCS
2010
Springer
13 years 7 months ago
Satisfiability of Acyclic and Almost Acyclic CNF Formulas
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
Sebastian Ordyniak, Daniël Paulusma, Stefan S...