Sciweavers

7519 search results - page 1350 / 1504
» Optimizing Generic Functions
Sort
View
SIAMJO
2000
108views more  SIAMJO 2000»
15 years 6 months ago
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
Houyuan Jiang, Daniel Ralph
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
15 years 6 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller
CMOT
1998
92views more  CMOT 1998»
15 years 6 months ago
SDML: A Multi-Agent Language for Organizational Modelling
A programming language which is optimized for modelling multi-agent interaction within articulated social structures such as organizations is described with several examples of it...
Scott Moss, Helen Gaylard, Steve Wallis, Bruce Edm...
AUTOMATICA
1999
145views more  AUTOMATICA 1999»
15 years 6 months ago
Control of systems integrating logic, dynamics, and constraints
This paper proposes a framework for modeling and controlling systems described by interdependent physical laws, logic rules, and operating constraints, denoted as mixed logical dy...
Alberto Bemporad, Manfred Morari
INFORMATICASI
1998
122views more  INFORMATICASI 1998»
15 years 6 months ago
Experimental Evaluation of Three Partition Selection Criteria for Decision Table Decomposition
Decision table decomposition is a machine learning approach that decomposes a given decision table into an equivalent hierarchy of decision tables. The approach aims to discover d...
Blaz Zupan, Marko Bohanec
« Prev « First page 1350 / 1504 Last » Next »