Sciweavers

1461 search results - page 204 / 293
» The Cost of Cache-Oblivious Searching
Sort
View
NLP
2000
15 years 9 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
CP
2008
Springer
15 years 8 months ago
Model Restarts for Structural Symmetry Breaking
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
Daniel S. Heller, Aurojit Panda, Meinolf Sellmann,...
MVA
2007
230views Computer Vision» more  MVA 2007»
15 years 7 months ago
A Rear Vehicle Location Algorithm for Lane Change Assist
A monocular vision based location algorithm is presented to detect and track rear vehicles for lane change assist. The algorithm uses the shadow underneath the vehicle to extract ...
Wei Liu, Chunyan Song, Pengyu Fu, Nan Wang, Huai Y...
BMCBI
2006
175views more  BMCBI 2006»
15 years 6 months ago
Parameter estimation for stiff equations of biosystems using radial basis function networks
Background: The modeling of dynamic systems requires estimating kinetic parameters from experimentally measured time-courses. Conventional global optimization methods used for par...
Yoshiya Matsubara, Shinichi Kikuchi, Masahiro Sugi...
INFORMATICALT
2006
88views more  INFORMATICALT 2006»
15 years 6 months ago
Improving the Performances of Asynchronous Algorithms by Combining the Nogood Processors with the Nogood Learning Techniques
Abstract. The asynchronous techniques that exist within the programming with distributed constraints are characterized by the occurrence of the nogood values during the search for ...
Ionel Muscalagiu, Vladimir Cretu