2107 search results - page 204 / 422 » Computing Small Search Numbers in Linear Time |
157
Voted
OPODIS
2007
15 years 5 months ago
2007
This report describes a necessary and sufficient test for the schedulability of a set of sporadic harddeadline tasks on a multiprocessor platform, using any of a variety of schedu...
159
click to vote
AUSAI
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
137
Voted
RSCTC
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
164
Voted
SIBGRAPI
2009
IEEE
15 years 10 months ago
2009
IEEE
We have designed and implemented a multi-linear discriminant method of constructing and quantifying statistically significant changes on human identity photographs. The method is...
134
Voted
PPL
2000
15 years 3 months ago
2000
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...