2938 search results - page 330 / 588 » On obfuscating point functions |
182
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
206
click to vote
VAMOS
2008
Springer
15 years 8 months ago
2008
Springer
Software Product Line engineering allows companies to realise significant improvements in timeto-market, cost, productivity, and system quality. One major difficulty with software...
183
click to vote
AAAI
2004
15 years 8 months ago
2004
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...
163
click to vote
AAAI
2006
15 years 8 months ago
2006
We consider the iterated belief change that occurs following an alternating sequence of actions and observations. At each instant, an agent has some beliefs about the action that ...
149
click to vote
CCCG
2004
15 years 8 months ago
2004
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...