Sciweavers

485 search results - page 42 / 97
» Unconstraint Assignment Problem: A Molecular Computing Appro...
Sort
View
137
Voted
ETT
2002
89views Education» more  ETT 2002»
15 years 2 months ago
Delay analysis of a probabilistic priority discipline
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...
Yuming Jiang, Chen-Khong Tham, Chi Chung Ko
118
Voted
ICPR
2004
IEEE
16 years 3 months ago
Relaxation Labeling Processes for Protein Secondary Structure Prediction
The prediction of protein secondary structure is a classical problem in bioinformatics, and in the past few years several machine learning techniques have been proposed to t. From...
Giacomo Colle, Marcello Pelillo
138
Voted
CVPR
2012
IEEE
13 years 5 months ago
Discrete-continuous optimization for multi-target tracking
The problem of multi-target tracking is comprised of two distinct, but tightly coupled challenges: (i) the naturally discrete problem of data association, i.e. assigning image obs...
Anton Andriyenko, Konrad Schindler, Stefan Roth
135
Voted
EUROMICRO
1999
IEEE
15 years 7 months ago
Design Space Exploration in System Level Synthesis under Memory Constraints
This paper addresses the problem of component selection, task assignment and task scheduling for distributed embedded computer systems. Such systems have a large number of constra...
Radoslaw Szymanek, Krzysztof Kuchcinski
112
Voted
ECRTS
2003
IEEE
15 years 8 months ago
Resource Partitioning among Real-Time Applications
When executing different real-time applications on a single processor system, one problem is how to compose these applications and guarantee at the same time that their timing req...
Giuseppe Lipari, Enrico Bini