6274 search results - page 556 / 1255 » Proofs, Programs, Processes |
187
click to vote
JSAC
2007
15 years 7 months ago
2007
— We introduce a new version of the widely studied survivable mapping problem in IP-over-WDM networks. The new problem allows augmenting the given logical topology and is describ...
142
click to vote
EOR
2002
15 years 7 months ago
2002
ct 9 The new concepts of repelling inequalities, repelling paths, and prime analytic centers are introduced. A repelling 10 path is a generalization of the analytic central path fo...
207
click to vote
JCSS
2000
15 years 7 months ago
2000
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
187
click to vote
MP
2007
15 years 7 months ago
2007
The question of nonemptiness of the intersection of a nested sequence of closed sets is fundamental in a number of important optimization topics, including the existence of optima...
232
click to vote
SAC
2008
ACM
15 years 7 months ago
2008
ACM
In this paper we investigate and propose a fully automated technique to perform conformance checking of Java implementations against UML class diagrams. In our approach, we reused...