Sciweavers

3791 search results - page 36 / 759
» Packing sets of patterns
Sort
View
TIT
2011
149views more  TIT 2011»
14 years 6 months ago
Network Coding for Computing: Cut-Set Bounds
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
Rathinakumar Appuswamy, Massimo Franceschetti, Nik...
AAAI
2007
15 years 1 months ago
Action-Space Partitioning for Planning
For autonomous artificial decision-makers to solve realistic tasks, they need to deal with searching through large state and action spaces under time pressure. We study the probl...
Natalia Hernandez-Gardiol, Leslie Pack Kaelbling
EOR
2006
73views more  EOR 2006»
14 years 11 months ago
An exact algorithm for the knapsack sharing problem with common items
We are concerned with a variation of the knapsack problem as well as of the knapsack sharing problem, where we are given a set of n items and a knapsack of a fixed capacity. As us...
Masako Fujimoto, Takeo Yamada
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
15 years 4 months ago
Improved Niching and Encoding Strategies for Clustering Noisy Data Sets
Clustering is crucial to many applications in pattern recognition, data mining, and machine learning. Evolutionary techniques have been used with success in clustering, but most su...
Olfa Nasraoui, Elizabeth Leon
89
Voted
FCT
2005
Springer
15 years 4 months ago
Generic Density and Small Span Theorem
We refine the genericity concept of Ambos-Spies, by assigning a real number in [0, 1] to every generic set, called its generic density. We construct sets of generic density any E...
Philippe Moser