Sciweavers

1077 search results - page 215 / 216
» Approximate reduction of dynamic systems
Sort
View
CCS
2007
ACM
13 years 10 months ago
Analyzing network traffic to detect self-decrypting exploit code
Remotely-launched software exploits are a common way for attackers to intrude into vulnerable computer systems. As detection techniques improve, remote exploitation techniques are...
Qinghua Zhang, Douglas S. Reeves, Peng Ning, S. Pu...
FCS
2007
13 years 8 months ago
Coordinating Planning Agents for Moderately and Tightly-Coupled Tasks
In many task-planning domains, dynamic assemblies of autonomous agents are replacing hierarchical organisations because they promise more agility. In such assemblies, interdepende...
J. Renze Steenhuisen, Cees Witteveen
4OR
2010
137views more  4OR 2010»
13 years 6 months ago
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
Michele Conforti, Gérard Cornuéjols,...
TISSEC
2008
235views more  TISSEC 2008»
13 years 6 months ago
SDAP: A Secure Hop-by-Hop Data Aggregation Protocol for Sensor Networks
Hop-by-hop data aggregation is a very important technique for reducing the communication overhead and energy expenditure of sensor nodes during the process of data collection in a...
Yi Yang, Xinran Wang, Sencun Zhu, Guohong Cao
CN
2000
107views more  CN 2000»
13 years 6 months ago
Query routing for Web search engines: architecture and experiments
General-purpose search engines such as AltaVista and Lycos are notorious for returning irrelevant results in response to user queries. Consequently, thousands of specialized, topi...
Atsushi Sugiura, Oren Etzioni