Sciweavers

23590 search results - page 578 / 4718
» Algorithm Performance Contest
Sort
View
CP
2006
Springer
15 years 10 months ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
Vibhav Gogate, Rina Dechter
WCNC
2010
IEEE
15 years 9 months ago
Novel Handoff Decision Algorithm in Hierarchical Macro/Femto-Cell Networks
Abstract—Hierarchical macro/femto-cell networks are considered as a promising technology for the improvement of indoor coverage and network capacity. In these emerging networks, ...
Jung-Min Moon, Dong-Ho Cho
NAA
2000
Springer
104views Mathematics» more  NAA 2000»
15 years 9 months ago
A Grid Free Monte Carlo Algorithm for Solving Elliptic Boundary Value Problems
In this work a grid free Monte Carlo algorithm for solving elliptic boundary value problems is investigated. The proposed Monte Carlo approach leads to a random process called a ba...
Todor V. Gurov, Paula A. Whitlock, Ivan Dimov
BMVC
2001
15 years 8 months ago
A Case Study in the use of ROC curves for Algorithm Design
We describe the development of a vision system to detect natural events in a low-resolution image stream. The work involves the assessment of algorithmic design decisions to maxim...
Paul A. Bromiley, Patrick Courtney, Neil A. Thacke...
AAAI
2008
15 years 8 months ago
Incremental Algorithms for Approximate Compilation
Compilation is an important approach to a range of inference problems, since it enables linear-time inference in the size S of the compiled representation. However, the main drawb...
Alberto Venturini, Gregory M. Provan