Sciweavers

3221 search results - page 176 / 645
» Termination of Linear Programs
Sort
View
ICLP
2010
Springer
15 years 4 months ago
Runtime Addition of Integrity Constraints in an Abductive Proof Procedure
Abductive Logic Programming is a computationally founded representation of abductive reasoning. In most ALP frameworks, integrity constraints express domainspecific logical relati...
Marco Alberti, Marco Gavanelli, Evelina Lamma
COCOA
2007
Springer
16 years 16 days ago
Fundamental Domains for Integer Programs with Symmetries
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...
Eric J. Friedman
IWINAC
2005
Springer
15 years 12 months ago
MEPIDS: Multi-Expression Programming for Intrusion Detection System
Abstract. An Intrusion Detection System (IDS) is a program that analyzes what happens or has happened during an execution and tries to find indications that the computer has been ...
Crina Grosan, Ajith Abraham, Sang-Yong Han
MP
2011
15 years 1 months ago
Lifting for conic mixed-integer programming
Lifting is a procedure for deriving valid inequalities for mixed-integer sets from valid inequalities for suitable restrictions of those sets. Lifting has been shown to be very e...
Alper Atamtürk, Vishnu Narayanan
GECCO
2011
Springer
248views Optimization» more  GECCO 2011»
14 years 9 months ago
Size-based tournaments for node selection
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
Thomas Helmuth, Lee Spector, Brian Martin