Sciweavers

1963 search results - page 148 / 393
» Applications of Preferences using Answer Set Programming
Sort
View
ACL
1997
15 years 4 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
149
Voted
WISE
2009
Springer
16 years 18 days ago
Web Queries: From a Web of Data to a Semantic Web
ct One significant effort towards combining the virtues of Web search, viz. being accessible to untrained users and able to cope with vastly heterogeneous data, with those of dat...
François Bry, Tim Furche, Klara A. Weiand
134
Voted
AAAI
2010
15 years 4 months ago
Approximation Algorithms and Mechanism Design for Minimax Approval Voting
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
Ioannis Caragiannis, Dimitris Kalaitzis, Evangelos...
130
Voted
CAI
2009
Springer
15 years 10 months ago
The Graph Programming Language GP
Abstract. GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handlin...
Detlef Plump
IDEAL
2000
Springer
15 years 7 months ago
Combining Ordinal Financial Predictions with Genetic Programming
Abstract. Ordinal data play an important part in financial forecasting. For example, advice from expert sources may take the form of "bullish", "bearish" or &qu...
Edward P. K. Tsang, Jin Li