11129 search results - page 35 / 2226 » Modeling Search Computing Applications |
APSEC
1996
IEEE
14 years 3 months ago
1996
IEEE
Explosive increase in end-user computing on distributed systems requires that end-users develop application software by themselves. One solution is given as aformula of "adom...
GECCO
2008
Springer
14 years 1 days ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
SPIRE
2005
Springer
14 years 4 months ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
ACSC
2006
IEEE
14 years 5 months ago
2006
IEEE
Information Retrieval (IR) is a major component in many of our daily activities, with perhaps its most prominent role manifested in search engines. Today’s most advanced engines...
ALGORITHMICA
2010
13 years 11 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...