Sciweavers

4224 search results - page 117 / 845
» Reasoning about Choice
Sort
View
CP
2003
Springer
15 years 10 months ago
Cost-Based Filtering for Shorter Path Constraints
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
Meinolf Sellmann
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
15 years 9 months ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy
COMMA
2008
15 years 7 months ago
A Methodology for Action-Selection using Value-Based Argumentation
This paper describes a method for decision making using argumentation. The method is intended to produce the decision considered most likely to promote the agent's aims and as...
Fahd Saud Nawwab, Trevor J. M. Bench-Capon, Paul E...
IJCAI
2003
15 years 7 months ago
On the Design of Social Diagnosis Algorithms for Multi-Agent Teams
Teamwork demands agreement among teammembers to collaborate and coordinate effectively. When a disagreement between teammates occurs (due to failures), team-members should ideally...
Meir Kalech, Gal A. Kaminka
DT
1998
85views more  DT 1998»
15 years 5 months ago
How Much Logic Should Go in an FPGA Logic Block?
The logic blocks of most modern FPGAs contain clusters of look-up tables and flip flops, yet little is known about good choices for several key architectural parameters related ...
Vaughn Betz, Jonathan Rose