1092 search results - page 183 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
112
Voted
WINE
2009
Springer
15 years 6 months ago
2009
Springer
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...
111
Voted
FOCS
1999
IEEE
15 years 6 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
109
click to vote
ICRA
1999
IEEE
15 years 6 months ago
1999
IEEE
Three fundamental problems in the study of grasping and dextrous manipulation with multifingered robotic hands are as follows. a) Given a robotic hand and a grasp characterized by ...
106
Voted
ICIAP
1999
ACM
15 years 6 months ago
1999
ACM
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...
148
Voted
DILS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Life science data sources represent a complex link-driven federation of publicly available Web accessible sources. A fundamental need for scientists today is the ability ...