Sciweavers

27 search results - page 4 / 6
» Polynomial-Time Algorithms for the Ordered Maximum Agreement...
Sort
View
COCO
2006
Springer
96views Algorithms» more  COCO 2006»
13 years 11 months ago
Optimal Hardness Results for Maximizing Agreements with Monomials
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
Vitaly Feldman
MOR
2008
169views more  MOR 2008»
13 years 7 months ago
The Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
Alper Atamtürk, Muhong Zhang
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
QSHINE
2005
IEEE
14 years 28 days ago
Link Scheduling with Power Control for Throughput Enhancement in Multihop Wireless Networks
Abstract— Throughput is an important performance consideration for multihop wireless networks. In this paper, we study the joint link scheduling and power control problem, focusi...
Jian Tang, Guoliang Xue, Christopher Chandler, Wei...
BIBM
2008
IEEE
112views Bioinformatics» more  BIBM 2008»
14 years 1 months ago
Fast Alignments of Metabolic Networks
Network alignments are extensively used for comparing, exploring, and predicting biological networks. Existing alignment tools are mostly based on isomorphic and homeomorphic embe...
Qiong Cheng, Piotr Berman, Robert W. Harrison, Ale...