3049 search results - page 95 / 610 » On the Convergence of Bound Optimization Algorithms |
144
click to vote
CANS
2009
Springer
15 years 11 months ago
2009
Springer
RFID systems suffer from different location-based attacks such as distance fraud, mafia fraud and terrorist fraud attacks. Among them mafia fraud attack is the most serious sin...
136
click to vote
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
119
click to vote
CATS
2006
15 years 5 months ago
2006
We investigate a scheduling problem motivated by pull-based data delivering systems where there is a server keeping a number of pages; and clients requesting the same page can be ...
124
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
COCO
2004
Springer
15 years 10 months ago
2004
Springer
We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due to Alon and Krivelevich, distinguishes between bipartite graphs and g...