Sciweavers

3172 search results - page 61 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
ESA
1998
Springer
105views Algorithms» more  ESA 1998»
15 years 5 months ago
Maximizing Job Completions Online
We consider the problem of maximizingthe number of jobs completed by their deadlinein an online single processor system where the jobs are preemptable and have release times. So i...
Bala Kalyanasundaram, Kirk Pruhs
102
Voted
ECCV
2010
Springer
15 years 4 months ago
Exploiting Repetitive Object Patterns for Model Compression and Completion
Many man-made and natural structures consist of similar elements arranged in regular patterns. In this paper we present an unsupervised approach for discovering and reasoning on re...
116
Voted
ACSC
2004
IEEE
15 years 4 months ago
Towards the Completion of the Formal Semantics of OCL 2.0
The Object Constraint Language (OCL) is part of the Unified Modeling Language (UML) to specify restrictions on values of a given UML model. As part of the UML 2.0 standardization ...
Stephan Flake
FASE
2008
Springer
15 years 2 months ago
A Generic Complete Dynamic Logic for Reasoning About Purity and Effects
For a number of programming languages, among them Eiffel, C, Java and Ruby, Hoare-style logics and dynamic logics have been developed. In these logics, pre- and postconditions are ...
Till Mossakowski, Lutz Schröder, Sergey Gonch...
98
Voted
DM
2008
76views more  DM 2008»
15 years 24 days ago
Graphic sequences with a realization containing a complete multipartite subgraph
A nonincreasing sequence of nonnegative integers = (d1, d2, ..., dn) is graphic if there is a (simple) graph G of order n having degree sequence . In this case, G is said to reali...
Guantao Chen, Michael Ferrara, Ronald J. Gould, Jo...