2766 search results - page 280 / 554 » Algorithms for trigonometric polynomials |
142
click to vote
CIAC
2010
Springer
16 years 2 months ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
132
click to vote
FOSSACS
2009
Springer
15 years 12 months ago
2009
Springer
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
144
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
133
Voted
MFCS
2007
Springer
15 years 11 months ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
138
click to vote
APN
2005
Springer
15 years 10 months ago
2005
Springer
This paper describes the verification module (the VipVerify Module) of the VipTool [4]. VipVerify allows to verify whether a given scenario is an execution of a system model, give...