26354 search results - page 4991 / 5271 » How we refactor, and how we know it |
149
click to vote
ECCC
2007
15 years 6 months ago
2007
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
165
click to vote
JPDC
2006
15 years 6 months ago
2006
The rapid growth of heterogeneous devices and diverse networks in our daily life, makes it is very difficult, if not impossible, to build a one-size-fits-all application or protoc...
144
click to vote
ENTCS
2007
15 years 6 months ago
2007
d abstract) David de Frutos Escrig1 ,3 Departamento de Sistemas Inform´aticos y Computaci´on Universidad Complutense de Madrid Madrid, Spain Carlos Gregorio Rodr´ıguez2 ,4 Depa...
168
click to vote
MTA
2008
15 years 6 months ago
2008
Providing scalable video services in a peer-to-peer (P2P) environment is challenging. Since videos are typically large and require high communication bandwidth for delivery, many ...
188
click to vote
NLE
2008
15 years 6 months ago
2008
Being able to identify which rhetorical relations (e.g., contrast or explanation) hold between spans of text is important for many natural language processing applications. Using ...