Sciweavers

3047 search results - page 590 / 610
» Aggregation functions: Means
Sort
View
CC
2007
Springer
121views System Software» more  CC 2007»
13 years 7 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
COMPLEXITY
2007
116views more  COMPLEXITY 2007»
13 years 7 months ago
Life, information, entropy, and time: Vehicles for semantic inheritance
abstractions provides an additional supra-phenotypic vehicle for semantic inheritance, which supports the cultural heritages around which civilizations revolve. The following three...
Antony R. Crofts
IJNSEC
2006
162views more  IJNSEC 2006»
13 years 7 months ago
Detecting and Evading Wormholes in Mobile Ad-hoc Wireless Networks
Mobile ad-hoc wireless networks are established in improvised environments through the mutual cooperation of its participating nodes. These nodes often operate in a physically ins...
Asad Amir Pirzada, Chris McDonald
JAIR
2008
103views more  JAIR 2008»
13 years 7 months ago
SATzilla: Portfolio-based Algorithm Selection for SAT
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton...
CORR
2007
Springer
77views Education» more  CORR 2007»
13 years 7 months ago
The Multiobjective Optimization of a Prismatic Drive
The multiobjective optimization of Slide-o-Cam is reported in this paper. Slide-o-Cam is a cam mechanism with multiple rollers mounted on a common translating follower. This trans...
Emilie Bouyer, Stéphane Caro, Damien Chabla...