Sciweavers

1289 search results - page 221 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
NETWORKING
2004
14 years 11 months ago
Scalable Packet Classification through Maximum Entropy Hashing
In this paper we propose a new packet classification algorithm, which can substantially improve the performance of a classifier by decreasing the rulebase lookup latency. The algor...
Lynn Choi, Jaesung Heo, Hyogon Kim, Jinoo Joung, S...
VMV
2004
80views Visualization» more  VMV 2004»
14 years 11 months ago
Memory Efficient Billboard Clouds for BTF Textured Objects
Efficiently rendering highly structured models distant from the viewer constitutes a difficult task since the geometric complexity has to be reduced extremely while simultaneously...
Jan Meseth, Reinhard Klein
NC
1998
138views Neural Networks» more  NC 1998»
14 years 11 months ago
Parallel Adaptive Genetic Algorithm
In this paper we introduce an efficient implementation of asynchronously parallel genetic algorithm with adaptive genetic operators. The classic genetic algorithm paradigm is exte...
Leo Budin, Marin Golub, Domagoj Jakobovic
CEC
2010
IEEE
14 years 11 months ago
Multi-objective memetic evolution of ART-based classifiers
In this paper we present a novel framework for evolving ART-based classification models, which we refer to as MOME-ART. The new training framework aims to evolve populations of ART...
Rong Li, Timothy R. Mersch, Oriana X. Wen, Assem K...
ECRTS
2010
IEEE
14 years 10 months ago
Preemption Points Placement for Sporadic Task Sets
Abstract--Limited preemption scheduling has been introduced as a viable alternative to non-preemptive and fullypreemptive scheduling when reduced blocking times need to coexist wit...
Marko Bertogna, Giorgio C. Buttazzo, Mauro Marinon...