Sciweavers

1197 search results - page 222 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
14 years 24 days ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
JAIR
2007
120views more  JAIR 2007»
13 years 7 months ago
An Algebraic Graphical Model for Decision with Uncertainties, Feasibilities, and Utilities
Numerous formalisms and dedicated algorithms have been designed in the last decades to model and solve decision making problems. Some formalisms, such as constraint networks, can ...
Cédric Pralet, Gérard Verfaillie, Th...
SIGECOM
2004
ACM
120views ECommerce» more  SIGECOM 2004»
14 years 1 months ago
Computational criticisms of the revelation principle
The revelation principle is a cornerstone tool in mechanism design. It states that one can restrict attention, without loss in the designer’s objective, to mechanisms in which A...
Vincent Conitzer, Tuomas Sandholm
CORR
2006
Springer
109views Education» more  CORR 2006»
13 years 8 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer
SOCO
2010
Springer
13 years 2 months ago
Taximeter verification with GPS and soft computing techniques
Until recently, local governments in Spain were using machines with rolling cylinders for verifying taximeters. However, the condition of the tires can lead to errors in the proces...
José Villar, Adolfo Otero, José Oter...