4103 search results - page 285 / 821 » Some results on the Collatz problem |
243
click to vote
TKDE
2012
13 years 9 months ago
2012
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
178
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
169
click to vote
TACAS
2009
Springer
16 years 1 months ago
2009
Springer
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
194
click to vote
IRI
2008
IEEE
16 years 1 months ago
2008
IEEE
There are many applications where multiple data sources, each with its own features, are integrated in order to perform an inference task in an optimal way. Researchers have shown...
154
click to vote
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...