3678 search results - page 261 / 736 » On the Stable Paths Problem |
147
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
In this paper an optimization based model order reduction (MOR) framework is proposed. The method involves setting up a quasiconvex program that explicitly minimizes a relaxation ...
172
click to vote
ISCAS
2005
IEEE
16 years 8 days ago
2005
IEEE
— Piecewise linear Lyapunov functions are used to design control gain matrices so that closed systems are robust stable and attractive regions are expanded as large as possible i...
158
click to vote
ICTCS
2005
Springer
16 years 5 days ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
159
click to vote
ICSM
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper is about client-specific customization of systems that implement an on-line Internet service in the presence of simultaneous client-specific views. The problem is that ...
168
click to vote
ICLP
1991
Springer
15 years 10 months ago
1991
Springer
Well Founded Semantics is adequate to capture nonmonotonic reasoning if we interpret the Well Founded model of a program P as a (possibly incomplete) view of the world. Thus the W...