Sciweavers

9227 search results - page 1719 / 1846
» Developing Use Cases from Organizational Modeling
Sort
View
AGP
2010
IEEE
15 years 9 months ago
Constraint Logic Programming
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
Marco Gavanelli, Francesca Rossi
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
15 years 9 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
16 years 4 months ago
Camouflaged fraud detection in domains with complex relationships
We describe a data mining system to detect frauds that are camouflaged to look like normal activities in domains with high number of known relationships. Examples include accounti...
Sankar Virdhagriswaran, Gordon Dakin
DIS
2001
Springer
15 years 9 months ago
Computational Discovery of Communicable Knowledge: Symposium Report
Abstract. The Symposium on Computational Discovery of Communicable Knowledge was held from March 24 to 25, 2001, at Stanford University. Fifteen speakers reviewed recent advances i...
Saso Dzeroski, Pat Langley
ANCS
2007
ACM
15 years 8 months ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos
« Prev « First page 1719 / 1846 Last » Next »