2080 search results - page 160 / 416 » Measuring empirical computational complexity |
151
click to vote
FQAS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Controlled languages (CLs) are ambiguity-free subsets of natural languages such as English offering a good trade-off between the formal rigor of ontology and query langua...
102
click to vote
COMPLEX
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. An interesting phenomenon about phyllotaxis is the divergence angle between two consecutive primordia. In this paper, we consider a dynamic model based on Max-Min princip...
179
click to vote
FOGA
2011
14 years 8 months ago
2011
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
135
click to vote
ICN
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Many studies explored the guaranteed TCP throughput problem in DiffServ networks. Several new marking schemes have been proposed in order to solve this problem. Even if ...
129
click to vote
SIGDOC
2004
ACM
15 years 10 months ago
2004
ACM
We analyzed texts from years 1800-2004 from the Philosophical Transactions of the Royal Society of London. Two-thousand-word sections from about 20 articles published at 25-year i...