Sciweavers

436 search results - page 85 / 88
» On two variations of identifying codes
Sort
View
CAV
2006
Springer
165views Hardware» more  CAV 2006»
14 years 1 months ago
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
Sebastian Burckhardt, Rajeev Alur, Milo M. K. Mart...
CEC
2010
IEEE
13 years 11 months ago
Learning-assisted evolutionary search for scalable function optimization: LEM(ID3)
Inspired originally by the Learnable Evolution Model(LEM) [5], we investigate LEM(ID3), a hybrid of evolutionary search with ID3 decision tree learning. LEM(ID3) involves interleav...
Guleng Sheri, David Corne
CCS
2010
ACM
13 years 10 months ago
Sidebuster: automated detection and quantification of side-channel leaks in web application development
A web application is a "two-part" program, with its components deployed both in the browser and in the web server. The communication between these two components inevita...
Kehuan Zhang, Zhou Li, Rui Wang 0010, XiaoFeng Wan...
AC
2008
Springer
13 years 10 months ago
Computing with RFID- Drivers, Technology and Implications
Radio Frequency Identification or simply rfid has come to be an integral part of modern computing. Rfid is notable in that it is the first practical technology to tightly couple p...
George Roussos
AI
2006
Springer
13 years 9 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang