3545 search results - page 326 / 709 » Computational methods for case-cohort studies |
175
click to vote
EXPCS
2007
15 years 10 months ago
2007
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...
194
click to vote
ISN
2000
Springer
15 years 10 months ago
2000
Springer
This paper examines load balancing issues relating to a distributed CORBA-based Service Control Point. Two types of load balancing strategies are explored through simulation studie...
159
click to vote
ISMB
2007
15 years 9 months ago
2007
Autopolyploidization and allopolyploidization events multiply the number of chromosomes and genomic content. Genome rearrangement phylogenetics requires that all genomes analyzed ...
142
click to vote
NSDI
2008
15 years 9 months ago
2008
Discretization is used in click-based graphical passwords so that approximately correct entries can be accepted by the system. We show that the existing discretization scheme of B...
183
Voted
ALENEX
2007
15 years 8 months ago
2007
In polyhedral studies of 0/1 polytopes two prominent problems exist. One is the vertex enumeration problem: Given a system of inequalities, enumerate its feasible 0/1 points. Anot...