6045 search results - page 962 / 1209 » Computable Linearizations of Well-partial-orderings |
148
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
159
click to vote
EUROPAR
2008
Springer
15 years 8 months ago
2008
Springer
Recent studies have showed the effectiveness of job co-scheduling in alleviating shared-cache contention on Chip Multiprocessors. Although program inputs affect cache usage and thu...
138
click to vote
CCCG
2007
15 years 8 months ago
2007
In this paper we study the problem of computing homothetic triangle contact representations of planar graphs. Since not all planar graphs admit such a representation, we concentra...
165
click to vote
CCCG
2008
15 years 8 months ago
2008
We are interested in the following mesh refinement problem: given an input set of points P in Rd , we would like to produce a good-quality triangulation by adding new points in P....
141
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
We examine the question of solving the extinction probability of a particular class of continuous-time multi-type branching processes, named Markovian binary trees (MBT). The exti...