Sciweavers

3359 search results - page 300 / 672
» A Simplified Idea Algorithm
Sort
View
NFM
2011
242views Formal Methods» more  NFM 2011»
14 years 10 months ago
Model Checking Using SMT and Theory of Lists
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
Aleksandar Milicevic, Hillel Kugler
SPIN
2004
Springer
15 years 8 months ago
Explicit State Model Checking with Hopper
The Murϕ-based Hopper tool is a general purpose explicit model checker. Hopper leverages Murϕ’s class structure to implement new algorithms. Hopper differs from Murϕ in that i...
Michael Jones, Eric Mercer
IJCAI
2001
15 years 4 months ago
Reinforcement Learning in Distributed Domains: Beyond Team Games
Using a distributed algorithm rather than a centralized one can be extremely beneficial in large search problems. In addition, the incorporation of machine learning techniques lik...
David Wolpert, Joseph Sill, Kagan Tumer
KAIS
2011
129views more  KAIS 2011»
14 years 10 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
ICCV
2007
IEEE
16 years 5 months ago
Uninitialized, Globally Optimal, Graph-Based Rectilinear Shape Segmentation The Opposing Metrics Method
We present a new approach for the incorporation of shape information into a segmentation algorithm. Unlike previous approaches to the problem, our method requires no initializatio...
Ali Kemal Sinop, Leo Grady