Sciweavers

2496 search results - page 44 / 500
» On covering by translates of a set
Sort
View
BPM
2008
Springer
112views Business» more  BPM 2008»
15 years 1 months ago
Covering Places and Transitions in Open Nets
We present a finite representation of all services M where the composition with a given service N is deadlock-free, and a given set of activities of N can be covered (i.e. is not d...
Christian Stahl, Karsten Wolf
CCCG
2008
15 years 1 months ago
Maximal Covering by Two Isothetic Unit Squares
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of poin...
Priya Ranjan Sinha Mahapatra, Partha P. Goswami, S...
ORL
2011
14 years 6 months ago
Solving large Steiner Triple Covering Problems
Computing the 1-width of the incidence matrix of a Steiner Triple System gives rise to small set covering instances that provide a computational challenge for integer programming ...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
15 years 6 months ago
Optimal nesting of species for exact cover of resources: two against many
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
Jeffrey Horn
ACL
2010
14 years 10 months ago
TrustRank: Inducing Trust in Automatic Translations via Ranking
The adoption of Machine Translation technology for commercial applications is hampered by the lack of trust associated with machine-translated output. In this paper, we describe T...
Radu Soricut, Abdessamad Echihabi