1254 search results - page 17 / 251 » Making Hard Problems Harder |
83
Voted
ICLP
1999
Springer
15 years 4 months ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
105
click to vote
EUROGP
2003
Springer
15 years 5 months ago
2003
Springer
Finite state transducers (FSTs) are finite state machines that map strings in a source domain into strings in a target domain. While there are many reports in the literature of ev...
105
click to vote
Publication
Abstract. Nowadays, the most dominant and noteworthy web information sources are developed according to the collaborative-web paradigm, also known as Web 2.0. In particular, it rep...
226
click to vote
SIGECOM
2011
ACM
14 years 3 months ago
2011
ACM
Market making refers broadly to trading strategies that seek to profit by providing liquidity to other traders, while avoiding accumulating a large net position in a stock. In th...
263
click to vote
CIDR
2011
14 years 4 months ago
2011
Structured query language (SQL) is a classical way to access relational databases. Although SQL is powerful to query relational databases, it is rather hard for inexperienced user...