Sciweavers

4290 search results - page 741 / 858
» Formal Approaches to Teamwork
Sort
View
AAAI
2000
15 years 7 months ago
Asynchronous Search with Aggregations
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Falt...
TREC
2003
15 years 7 months ago
Identifying Gene Function Descriptions by Probability-based Sentence Selection
This paper proposes an approach to the secondary task in the TREC Genomics Track. We regard the task as identification of the sentences describing gene functions (i.e., GeneRIFs)...
Kazuhiro Seki, Nihar Sheth, Javed Mostafa
FTCS
1998
144views more  FTCS 1998»
15 years 7 months ago
Improving Software Robustness with Dependability Cases
Programs fail mainly for two reasons: logic errors in the code, and exception failures. Exception failures can account for up to 2/3 of system crashes [6], hence are worthy of ser...
Roy A. Maxion, Robert T. Olszewski
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 7 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
UAI
2000
15 years 7 months ago
Feature Selection and Dualities in Maximum Entropy Discrimination
Incorporating feature selection into a classi cation or regression method often carries a number of advantages. In this paper we formalize feature selection speci cally from a dis...
Tony Jebara, Tommi Jaakkola