986 search results - page 98 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
187
click to vote
TC
2002
15 years 5 months ago
2002
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
186
click to vote
SECON
2007
IEEE
16 years 16 days ago
2007
IEEE
—In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped with multiple radio interfaces and multiple channels are available for communicat...
196
click to vote
WAW
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
202
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
205
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...