4112 search results - page 180 / 823 » Efficient Algorithms for the Spoonerism Problem |
146
Voted
DATESO
2010
15 years 2 months ago
2010
Abstract. Current XPath processors use direct approach to query evaluation which is quite inefficient in some cases and usually implemented serially. This may be a problem in case ...
145
click to vote
ASPDAC
2008
ACM
15 years 6 months ago
2008
ACM
Abstract-- We address performance maximization of independent task sets under energy constraint on chip multi-processor (CMP) architectures that support multiple voltage/frequency ...
150
Voted
AIPS
2010
15 years 4 months ago
2010
We introduce the Scanalyzer planning domain, a domain for classical planning which models the problem of automatic greenhouse logistic management. At its mathematical core, the Sc...
142
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
158
Voted
ECIR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Machine learning ranking methods are increasingly applied to ranking tasks in information retrieval (IR). However ranking tasks in IR often differ from standard ranking t...