1738 search results - page 289 / 348 » An algorithmic framework for network reconstruction |
CCO
2001
Springer
14 years 6 days ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
JAIR
2007
13 years 7 months ago
2007
Numerous formalisms and dedicated algorithms have been designed in the last decades to model and solve decision making problems. Some formalisms, such as constraint networks, can ...
NDSS
2008
IEEE
14 years 2 months ago
2008
IEEE
Automatic signature generation is necessary because there may often be little time between the discovery of a vulnerability, and exploits developed to target the vulnerability. Mu...
MOBISYS
2009
ACM
14 years 8 months ago
2009
ACM
Mobile devices often store data in reduced resolutions or custom formats in order to accommodate resource constraints and tailormade software. The Polyjuz framework enables sharin...
MOBISYS
2003
ACM
14 years 7 months ago
2003
ACM
Due to node mobility and limitations on bandwidth availability in wireless channels, there exist unique challenges towards achieving efficient and effective information access in ...