Sciweavers

4224 search results - page 801 / 845
» Reasoning about Choice
Sort
View
SPAA
2003
ACM
14 years 3 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
AI
2003
Springer
14 years 3 months ago
Negotiating Exchanges of Private Information for Web Service Eligibility
Private information about individuals that engage in e-commerce business transactions is of economic value to businesses for market analysis and for identifying possible future par...
Keping Jia, Bruce Spencer
ATAL
2003
Springer
14 years 3 months ago
Negotiation over tasks in hybrid human-agent teams for simulation-based training
The effectiveness of simulation-based training for individual tasks – such as piloting skills – is well established, but its use for team training raises challenging technical...
David R. Traum, Jeff Rickel, Jonathan Gratch, Stac...
AUSAI
2003
Springer
14 years 3 months ago
Choosing Learning Algorithms Using Sign Tests with High Replicability
An important task in machine learning is determining which learning algorithm works best for a given data set. When the amount of data is small the same data needs to be used repea...
Remco R. Bouckaert
CP
2003
Springer
14 years 3 months ago
Exploiting Multidirectionality in Coarse-Grained Arc Consistency Algorithms
Arc consistency plays a central role in solving Constraint Satisfaction Problems. This is the reason why many algorithms have been proposed to establish it. Recently, an algorithm ...
Christophe Lecoutre, Frédéric Bousse...