Sciweavers

377 search results - page 48 / 76
» Linear Tabling Strategies and Optimizations
Sort
View
JC
2006
61views more  JC 2006»
13 years 7 months ago
The discretized discrepancy principle under general source conditions
We discuss adaptive strategies for choosing regularization parameters in TikhonovPhillips regularization of discretized linear operator equations. Two rules turn out to be entirel...
Peter Mathé, Sergei V. Pereverzev
TSP
2008
107views more  TSP 2008»
13 years 7 months ago
Opportunistic Spectrum Access via Periodic Channel Sensing
The problem of opportunistic access of parallel channels occupied by primary users is considered. Under a continuous-time Markov chain modeling of the channel occupancy by the prim...
Qing Zhao, Stefan Geirhofer, Lang Tong, Brian M. S...
WCNC
2010
IEEE
13 years 5 months ago
Sensing and Communication Tradeoff for Cognitive Access of Continues-Time Markov Channels
—Dynamic spectrum access (DSA) aims to improve spectrum efficiency via spectrum sensing and optimal spectrum access. An essential component in DSA is the joint design of sensing...
Xin Li, Qianchuan Zhao, Xiaohong Guan, Lang Tong
CP
2009
Springer
14 years 8 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
13 years 7 months ago
On Binary Searching with Nonuniform Costs
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...