15073 search results - page 2618 / 3015 » Probabilistic algorithms for computing resultants |
153
Voted
COCO
2004
Springer
15 years 8 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
146
Voted
DATE
2004
IEEE
15 years 8 months ago
2004
IEEE
A distributed sensor network (DSN) designed to cover a given region R, is said to be alive if there is at least one subset of sensors that can collectively cover (sense) the regio...
134
click to vote
CIT
2006
Springer
15 years 8 months ago
2006
Springer
Hash functions play the most important role in various cryptologic applications, ranging from data integrity checking to digital signatures. Our goal is to introduce a new hash fu...
156
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
127
click to vote
HYBRID
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Sincehybridembeddedsystemsarepervasiveandoftensafetycritical, guarantees about their correct performance are desirable. The hybrid systemsmodelcheckerHyTech providessuch ...