20197 search results - page 3658 / 4040 » Comparing Computational Power |
139
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
143
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract--Virtualization technology facilitates a dynamic, demanddriven allocation and migration of servers. This paper studies how the flexibility offered by network virtualizatio...
239
click to vote
MIS
2011
Springer
14 years 11 months ago
2011
Springer
By exchanging events in a vehicular ad hoc network (VANET), drivers can receive information that allows them to find relevant places (e.g., parking spaces) or avoid dangerous/unde...
159
click to vote
MOC
2011
14 years 11 months ago
2011
The simplest pair of spaces P1/P0 is made inf-sup stable for the mixed form of the Darcy equation. The key ingredient is enhance the finite element spaces inside a PetrovGalerkin ...
156
click to vote
PAMI
2011
14 years 11 months ago
2011
—A novel framework is proposed for the design of cost-sensitive boosting algorithms. The framework is based on the identification of two necessary conditions for optimal cost-sen...