Sciweavers

257 search results - page 28 / 52
» ai 2006
Sort
View
AI
2006
Springer
14 years 9 months ago
The complexity of soft constraint satisfaction
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint type...
David A. Cohen, Martin C. Cooper, Peter Jeavons, A...
AI
2006
Springer
15 years 1 months ago
Adaptive Fraud Detection Using Benford's Law
Abstract. Adaptive Benford's Law [1] is a digital analysis technique that specifies the probabilistic distribution of digits for many commonly occurring phenomena, even for in...
Fletcher Lu, J. Efrim Boritz, H. Dominic Covvey
AI
2006
Springer
14 years 9 months ago
Propagation algorithms for lexicographic ordering constraints
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian...
80
Voted
IJVR
2006
178views more  IJVR 2006»
14 years 9 months ago
Scene Synchronization in Close Coupled World Representations Using SCIVE
This paper introduces SCIVE, a Simulation Core for Intelligent Virtual Environments. SCIVE provides a Knowledge Representation Layer (KRL) as a central organizing struc...
Marc Erich Latoschik, Christian Fröhlich, Ale...
JSAT
2006
126views more  JSAT 2006»
14 years 9 months ago
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
Sylvie Coste-Marquis, Daniel Le Berre, Florian Let...