Sciweavers

1197 search results - page 16 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
ICAL
2011
301views more  ICAL 2011»
12 years 7 months ago
On the LVI-based numerical method (E47 algorithm) for solving quadratic programming problems
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
Yunong Zhang, Senbo Fu, Zhijun Zhang, Lin Xiao, Xu...
NETWORKS
2008
13 years 8 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
TWC
2008
158views more  TWC 2008»
13 years 7 months ago
Solving Box-Constrained Integer Least Squares Problems
A box-constrained integer least squares problem (BILS) arises from several wireless communications applications. Solving a BILS problem usually has two stages: reduction (or prepro...
Xiao-Wen Chang, Qing Han
UML
2000
Springer
13 years 11 months ago
Extending OCL to include Actions
The UML's Object Constraint Language provides the modeller of object-oriented systems with ways to express the semantics of a model in a precise and declarative manner. The co...
Anneke Kleppe, Jos Warmer
SMA
2006
ACM
107views Solid Modeling» more  SMA 2006»
14 years 1 months ago
Solving topological constraints for declarative families of objects
Parametric and feature-based CAD models can be considered to represent families of similar objects. In current modelling systems, however, the semantics of such families are uncle...
Hilderick A. van der Meiden, Willem F. Bronsvoort