Sciweavers

1941 search results - page 179 / 389
» On the Hardness of Approximate Reasoning
Sort
View
ECAI
2008
Springer
15 years 8 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
FTCS
1998
79views more  FTCS 1998»
15 years 7 months ago
Proving Correctness of a Controller Algorithm for the RAID Level 5 System
Most RAID controllers implemented in industry are complicated and di cult to reason about. This complexity has led to software and hardware systems that are di cult to debug and h...
Mandana Vaziri, Nancy A. Lynch, Jeannette M. Wing
AAAI
1994
15 years 7 months ago
An Instructional Environment for Practicing Argumentation Skills
CAT0 is an instructions environment for practicing basic skills of legal research: to use cases in arguments about a problem situation and to test a theory about a legal domain. U...
Vincent Aleven, Kevin D. Ashley
CSL
2006
Springer
15 years 6 months ago
Application-independent evaluation of speaker detection
We propose and motivate an alternative to the traditional error-based or cost-based evaluation metrics for the goodness of speaker detection performance. The metric that we propos...
Niko Brümmer, Johan A. du Preez
GIS
2010
ACM
15 years 4 months ago
Kernelized map matching
Map matching is a fundamental operation in many applications such as traffic analysis and location-aware services, the killer apps for ubiquitous computing. In the past, several m...
Ahmed Jawad, Kristian Kersting