Sciweavers

700 search results - page 81 / 140
» Towards a theory of
Sort
View
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
13 years 9 months ago
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
János Barát, Jirí Matousek, D...
ATAL
2005
Springer
14 years 2 months ago
Design by Contract Deontic Design Language for Multiagent Systems
Abstract. Design by contract is a well known theory that views software construction as based on contracts between clients (callers) and suppliers (routines), relying on mutual obl...
Christophe Garion, Leendert van der Torre
TCS
2010
13 years 7 months ago
Alternating states for dual nondeterminism in imperative programming
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
Wim H. Hesselink
ICPR
2004
IEEE
14 years 10 months ago
To FRAME or not to FRAME in Probabilistic Texture Modelling?
The maximum entropy principle is a cornerstone of FRAME (Filters, RAndom fields, and Maximum Entropy) model considered at times as a first-ever step towards a universal theory of ...
Georgy L. Gimel'farb, Luc J. Van Gool, Alexey Zale...
SPAA
2009
ACM
14 years 9 months ago
On avoiding spare aborts in transactional memory
This paper takes a step toward developing a theory for understanding aborts in transactional memory systems (TMs). Existing TMs may abort many transactions that could, in fact, co...
Idit Keidar, Dmitri Perelman