Sciweavers

871 search results - page 168 / 175
» The vertex-cover polynomial of a graph
Sort
View
CGO
2003
IEEE
15 years 1 months ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue
CHARME
2003
Springer
110views Hardware» more  CHARME 2003»
15 years 1 months ago
Exact and Efficient Verification of Parameterized Cache Coherence Protocols
Abstract. We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. F...
E. Allen Emerson, Vineet Kahlon
BMCBI
2006
127views more  BMCBI 2006»
14 years 9 months ago
Construction of phylogenetic trees by kernel-based comparative analysis of metabolic networks
Background: To infer the tree of life requires knowledge of the common characteristics of each species descended from a common ancestor as the measuring criteria and a method to c...
Sok June Oh, Je-Gun Joung, Jeong Ho Chang, Byoung-...
COCOA
2009
Springer
15 years 26 days ago
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
Jingfa Liu, Yonglei Yao, Yu Zheng, Huantong Geng, ...
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
15 years 10 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...