Sciweavers

855 search results - page 23 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
74
Voted
AAAI
2012
13 years 1 days ago
Threats and Trade-Offs in Resource Critical Crowdsourcing Tasks Over Networks
In recent times, crowdsourcing over social networks has emerged as an active tool for complex task execution. In this paper, we address the problem faced by a planner to incentivi...
Swaprava Nath, Pankaj Dayama, Dinesh Garg, Y. Nara...
JUCS
2008
122views more  JUCS 2008»
14 years 9 months ago
On the Subrecursive Computability of Several Famous Constants
: For any class F of total functions in the set N of the natural numbers, we define the notion of F-computable real number. A real number is called Fcomputable if there exist one-...
Dimiter Skordev
PAMI
2011
14 years 4 months ago
Color Constancy Using Natural Image Statistics and Scene Semantics
—Existing color constancy methods are all based on specific assumptions such as the spatial and spectral characteristics of images. As a consequence, no algorithm can be conside...
Arjan Gijsenij, Theo Gevers
MFCS
2005
Springer
15 years 3 months ago
Regular Sets of Higher-Order Pushdown Stacks
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
Arnaud Carayol
55
Voted
AI
2005
Springer
14 years 9 months ago
The complexity of contract negotiation
The use of software agents for automatic contract negotiation in e-commerce and e-trading ents has been the subject of considerable recent interest. A widely studied abstract mode...
Paul E. Dunne, Michael Wooldridge, Michael Laurenc...