Sciweavers

889 search results - page 40 / 178
» Problems in Rewriting III
Sort
View
WSNA
2003
ACM
14 years 3 months ago
The coverage problem in a wireless sensor network
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
Chi-Fu Huang, Yu-Chee Tseng
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
14 years 3 months ago
The enhanced evolutionary tabu search and its application to the quadratic assignment problem
We describe the Enhanced Evolutionary Tabu Search (EE-TS) local search technique. The EE-TS metaheuristic technique combines Reactive Tabu Search with evolutionary computing eleme...
John F. McLoughlin III, Walter Cedeño
CRYPTO
1999
Springer
109views Cryptology» more  CRYPTO 1999»
14 years 2 months ago
Coding Constructions for Blacklisting Problems without Computational Assumptions
Abstract. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2n users so that all but some specified coalition of k excl...
Ravi Kumar, Sridhar Rajagopalan, Amit Sahai
ICDM
2009
IEEE
131views Data Mining» more  ICDM 2009»
13 years 7 months ago
Unified Solution to Nonnegative Data Factorization Problems
In this paper, we restudy the non-convex data factorization problems (regularized or not, unsupervised or supervised), where the optimization is confined in the nonnegative orthan...
Xiaobai Liu, Shuicheng Yan, Jun Yan, Hai Jin
CORR
2008
Springer
109views Education» more  CORR 2008»
13 years 10 months ago
New Combinatorial Complete One-Way Functions
In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we presen...
Arist Kojevnikov, Sergey I. Nikolenko