Sciweavers

1186 search results - page 41 / 238
» Improving Random Walk Performance
Sort
View
AAAI
1997
14 years 10 days ago
Tabu Search for SAT
In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Se...
Bertrand Mazure, Lakhdar Sais, Éric Gr&eacu...
IJCSA
2007
104views more  IJCSA 2007»
13 years 10 months ago
Solving the Satisfiability Problem Using Finite Learning Automata
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
Ole-Christoffer Granmo, Noureddine Bouhmala
ICASSP
2011
IEEE
13 years 2 months ago
Transitional surrogates
While an exact stationarization of a process with a given spectrum magnitude can be obtained via a complete randomization of the spectrum phase (“surrogates” technique), we pr...
Pierre Borgnat, Patrick Flandrin, André Fer...
SRDS
2006
IEEE
14 years 5 months ago
Call Availability Prediction in a Telecommunication System: A Data Driven Empirical Approach
Availability prediction in a telecommunication system plays a crucial role in its management, either by alerting the operator to potential failures or by proactively initiating pr...
Günther A. Hoffmann, Miroslaw Malek
COMPGEOM
2003
ACM
14 years 4 months ago
Incremental constructions con BRIO
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
Nina Amenta, Sunghee Choi, Günter Rote