Sciweavers

986 search results - page 5 / 198
» Generalized Goal Programming: polynomial methods and applica...
Sort
View
ICLP
2010
Springer
13 years 11 months ago
Methods and Methodologies for Developing Answer-Set Programs - Project Description
Answer-set programming (ASP) is a well-known formalism for declarative problem solving, enjoying a continuously increasing number of diverse applications. However, arguably one of ...
Johannes Oetsch, Jörg Pührer, Hans Tompi...
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
14 years 4 days ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
MP
2008
117views more  MP 2008»
13 years 7 months ago
Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
Abstract. We study piecewise decomposition methods for mathematical programs with equilibrium constraints (MPECs) for which all constraint functions are linear. At each iteration o...
Giovanni Giallombardo, Daniel Ralph
KDD
2006
ACM
201views Data Mining» more  KDD 2006»
14 years 8 months ago
Polynomial association rules with applications to logistic regression
A new class of associations (polynomial itemsets and polynomial association rules) is presented which allows for discovering nonlinear relationships between numeric attributes wit...
Szymon Jaroszewicz
AI
2008
Springer
13 years 7 months ago
Maintenance goals of agents in a dynamic environment: Formulation and policy construction
The notion of maintenance often appears in the AI literature in the context of agent behavior and planning. In this paper, we argue that earlier characterizations of the notion of...
Chitta Baral, Thomas Eiter, Marcus Bjäreland,...