3545 search results - page 260 / 709 » Computational methods for case-cohort studies |
183
click to vote
RECOMB
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
205
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
200
click to vote
ECRTS
2006
IEEE
16 years 22 days ago
2006
IEEE
Real-time systems are often designed using a set of periodic tasks. Task periods are usually set by the system requirements, but deadlines and computation times can be modified i...
208
click to vote
GECCO
2005
Springer
16 years 6 days ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
178
click to vote
RT
1998
Springer
15 years 11 months ago
1998
Springer
In this paper we develop a technique for measuring the perceptual equivalence of a graphical scene to a real scene. Ability to compare images is valuable in computer graphics for a...