Sciweavers

969 search results - page 70 / 194
» Generalized matching from theory to application
Sort
View
WM
2003
13 years 10 months ago
Worlds, Models, and KM
Techniques for computation on generalized diagrams are defined and the KM implications are explored. Descriptive Computing is presented and plan computation based on world models t...
Cyrus F. Nourani
ANCS
2010
ACM
13 years 6 months ago
A traffic-aware top-N firewall ruleset approximation algorithm
Packet classification is widely used in various network security and operation applications. Two of the main challenges are the increasing number of classification rules, amount o...
Ho-Yu Lam, Donghan (Jarod) Wang, H. Jonathan Chao
KDD
2009
ACM
146views Data Mining» more  KDD 2009»
14 years 4 months ago
Online allocation of display advertisements subject to advanced sales contracts
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
Saeed Alaei, Esteban Arcaute, Samir Khuller, Wenji...
HT
2009
ACM
14 years 3 months ago
On hypertext narrative
Annals and chronicles may be the foundation of accounting, but writers of stories and histories have long known that they seldom render a satisfactory account of complex events. I...
Mark Bernstein
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
14 years 3 months ago
Analysis of evolutionary algorithms for the longest common subsequence problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Thomas Jansen, Dennis Weyland