107 search results - page 3 / 22 » Applicative Lifting |
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
Finding a good wavelet for a particular application and type of input data is a difficult problem. Traditional methods of wavelet deus on abstract properties of the wavelet that ca...
EOR
2008
13 years 5 months ago
2008
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...
ICWE
2004
Springer
13 years 10 months ago
2004
Springer
The Semantic Web will allow software agents to understand and reason about data provided by Web applications. Unfortunately, formal ontologies, needed to express data semantics, ar...
TIT
2010
12 years 12 months ago
2010
Abstract--Motivated by applications of distributed linear estimation, distributed control, and distributed optimization, we consider the question of designing linear iterative algo...
CPC
2010
13 years 2 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...