Sciweavers

2181 search results - page 374 / 437
» The restriction scaffold problem
Sort
View
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
13 years 9 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
DAM
2010
112views more  DAM 2010»
13 years 8 months ago
New results on optimizing rooted triplets consistency
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
ECCC
2006
116views more  ECCC 2006»
13 years 8 months ago
Uniform Hardness Amplification in NP via Monotone Codes
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul...
IJCSA
2008
108views more  IJCSA 2008»
13 years 8 months ago
Consistency Check Algorithms for Multi-Dimensional Preference Trade-Offs
: Skyline Queries have recently received a lot of attention due to their intuitive query capabilities. Following the concept of Pareto optimality all `best' database objects a...
Christoph Lofi, Wolf-Tilo Balke, Ulrich Güntz...
CAD
2005
Springer
13 years 8 months ago
Frontal geometry from sketches of engineering objects: is line labelling necessary?
A tool which can quickly interpret line drawings (with hidden lines removed) of engineering objects as boundary representation CAD models would be of significant benefit in the pr...
P. A. C. Varley, Ralph R. Martin, Hiromasa Suzuki