6562 search results - page 180 / 1313 » Noetherianity and Combination Problems |
171
click to vote
ALENEX
2009
15 years 4 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
147
click to vote
ICDAR
2009
IEEE
16 years 1 months ago
2009
IEEE
Table analysis is a complex problem, involving searching solutions from a large search space. Studies show that finding the most credible answers to complex problems often requir...
179
click to vote
DDECS
2008
IEEE
16 years 28 days ago
2008
IEEE
Abstract—In Network-on-Chip (NoC) application design, coreto-node mapping is an important but intractable optimization problem. In the paper, we use simulated annealing to tackle...
154
click to vote
ESWA
2007
15 years 6 months ago
2007
Examination timetabling problems are often solved by a two-phase procedure combining a sequential construction heuristic with a metaheuristic improvement search. There can be many...
194
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages under the theory of ...