Sciweavers

837 search results - page 38 / 168
» Hard combinators
Sort
View
AIR
2010
96views more  AIR 2010»
14 years 12 months ago
Logic programming for combinatorial problems
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for...
Toshinori Munakata, Roman Barták
CORR
2008
Springer
118views Education» more  CORR 2008»
14 years 12 months ago
Strategic Alert Throttling for Intrusion Detection Systems
: Network intrusion detection systems are themselves becoming targets of attackers. Alert flood attacks may be used to conceal malicious activity by hiding it among a deluge of fa...
Gianni Tedesco, Uwe Aickelin
CORR
2010
Springer
128views Education» more  CORR 2010»
14 years 12 months ago
Sublinear Optimization for Machine Learning
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
ENTCS
2008
99views more  ENTCS 2008»
14 years 12 months ago
ArcAngelC: a Refinement Tactic Language for Circus
Circus is a refinement language, in which specifications define both data and behavioural aspects of concurrent systems using a combination of Z and CSP. Its refinement theory and...
M. V. M. Oliveira, A. L. C. Cavalcanti
EOR
2006
134views more  EOR 2006»
14 years 11 months ago
A smoothing heuristic for a bilevel pricing problem
In this paper, we provide a heuristic procedure, that performs well from a global optimality point of view, for an important and difficult class of bilevel programs. The algorithm...
Jean-Pierre Dussault, Patrice Marcotte, Séb...