4513 search results - page 830 / 903 » Logic programming with satisfiability |
130
click to vote
PRDC
2002
IEEE
15 years 6 months ago
2002
IEEE
Grid computing relies on fragile partnerships. Clients with hundreds or even thousands of pending service requests must seek out and form temporary alliances with remote servers e...
126
click to vote
INFOCOM
2000
IEEE
15 years 6 months ago
2000
IEEE
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...
115
click to vote
RTAS
1999
IEEE
15 years 5 months ago
1999
IEEE
We present a QoS management framework that enables us to quantitatively measure QoS, and to analytically plan and allocate resources. In this model, end users' quality prefer...
116
click to vote
COMPSAC
1997
IEEE
15 years 5 months ago
1997
IEEE
Building a system at the architectural level can be thought of as decomposition into components followed by a series of exercises in matching. Components must be composed with eac...
112
click to vote
ICDT
2010
ACM
15 years 5 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...