1566 search results - page 154 / 314 » On a Cone Covering Problem |
145
click to vote
CIAC
2010
Springer
16 years 1 months ago
2010
Springer
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
166
click to vote
ASWEC
2006
IEEE
15 years 8 months ago
2006
IEEE
We propose a software development method for enterprise applications that combines the use of the structural concepts provided by problem frames, and the use of the UML notation. ...
136
Voted
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
ABSTRACT. Multiset pushdown systems have been introduced by Sen and Viswanathan as an adequate model for asynchronous programs where some procedure calls can be stored as tasks to ...
132
Voted
CJ
2008
15 years 4 months ago
2008
We will describe three kinds of probabilistic induction problems, and give general solutions for each , with associated convergence theorems that show they tend to give good proba...
146
click to vote
DISOPT
2006
15 years 4 months ago
2006
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...