IPSN
2007
Springer
14 years 5 months ago
2007
Springer
Large-scale sensor network applications require in-network processing and data fusion to compute statistically relevant summaries of the sensed measurements. This paper studies di...
ICA3PP
2007
Springer
14 years 5 months ago
2007
Springer
Classification is a kind of basic semantics that people often use to manage versatile contents in daily life. Resource Space Model (RSM) is a semantic model for sharing and managin...
ICA3PP
2007
Springer
14 years 5 months ago
2007
Springer
Ubiquitous communications require wireless networking and infrastructure network support. The first step is to look at how the different available technologies will integrate and w...
ICA3PP
2007
Springer
14 years 5 months ago
2007
Springer
We propose a source peer selection algorithm which efficiently chooses peers as sources from a set of peers having the requested file in a hybrid P2P file sharing system. Our propo...
IBPRIA
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. By applying recent results in optimization transfer, a new algorithm for kernel Fisher Discriminant Analysis is provided that makes use of a non-smooth penalty on the coe...
GECCO
2007
Springer
14 years 5 months ago
2007
Springer
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
GECCO
2007
Springer
14 years 5 months ago
2007
Springer
Artificial Immune System algorithms use antibodies which fully specify the solution of an optimization, learning, or pattern recognition problem. By being restricted to fully spec...
GECCO
2007
Springer
14 years 5 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
GECCO
2007
Springer
14 years 5 months ago
2007
Springer
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
FUN
2007
Springer
14 years 5 months ago
2007
Springer
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...