113 search results - page 13 / 23 » Brief announcement: new bounds for the controller problem |
PLDI
1990
ACM
13 years 11 months ago
1990
ACM
Languages such as Scheme and Smalltalk that provide continuations as first-class data objects present a challenge to efficient implementation. Allocating activation records in a h...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— The paper studies the visibility maintenance problem (VMP) for a leader-follower pair of robots modelled as first-order dynamic systems and proposes an original solution based...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
— In this paper we study the problem of jointly performing scheduling and congestion control in mobile adhoc networks so that network queues remain bounded and the resulting flo...
ITNG
2007
IEEE
14 years 2 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
SODA
2000
ACM
13 years 9 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...