Sciweavers

413 search results - page 31 / 83
» Computing and Exploiting Tree-Decompositions for Solving Con...
Sort
View
PPDP
2005
Springer
15 years 6 months ago
Heuristics, optimizations, and parallelism for protein structure prediction in CLP(FD)
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...
Alessandro Dal Palù, Agostino Dovier, Enric...
REST
2010
ACM
15 years 5 months ago
A RESTful messaging system for asynchronous distributed processing
Traditionally, distributed computing problems have been solved by partitioning data into chunks able to be handled by commodity hardware. Such partitioning is not possible in case...
Ian Jacobi, Alexey Radul
WICON
2008
15 years 2 months ago
HxH: a hop-by-hop transport protocol for multi-hop wireless networks
TCP can perform poorly in multi-hop wireless networks due to problems that arise with contention and mobility. Endto-end protocols are at an inherent disadvantage in trying to sol...
Daniel Scofield, Lei Wang, Daniel Zappala
CCS
2010
ACM
15 years 1 months ago
Input generation via decomposition and re-stitching: finding bugs in Malware
Attackers often take advantage of vulnerabilities in benign software, and the authors of benign software must search their code for bugs in hopes of finding vulnerabilities before...
Juan Caballero, Pongsin Poosankam, Stephen McCaman...
ICNSC
2007
IEEE
15 years 7 months ago
Improved estimation for object localization via sensor networks
The paper addresses object localization via a distributed sensor network. A centralized estimation approach is undertaken along with a selective node activation strategy to ensure...
Alessio Benavoli, Luigi Chisci