787 search results - page 137 / 158 » Polynomial Constants are Decidable |
134
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
155
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
158
click to vote
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
143
click to vote
KBSE
2007
IEEE
15 years 10 months ago
2007
IEEE
We explore the automatic generation of test data that respect constraints expressed in the Object-Role Modeling (ORM) language. ORM is a popular conceptual modeling language, prim...
120
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...