Searching for "Polynomial Search." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

53 documents found, showing 1 through 10. Next 10 →

Closed-Form Mapping Conditions for the Synthesis of Linear Processor Arrays
by Jingling Xue — 1995
… be solved efficiently by a systematic enumeration of a polynomial search space. 1 Introduction…
Cited by 2 (1 self) – Add To MetaCart

Optimal Edge Ranking of Trees in Polynomial Time
by Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer — 1993
… search space down to a polynomial search space containing an optimal solution. An NC algorithm…
Cited by 7 (1 self) – Add To MetaCart

epsilon-Transformation: Exploiting Phase Transitions to Solve Combinatorial Optimization Problems
by Weixiong Zhang, Joseph C. Pemberton — 1994 — Artificial Intelligence
… search problems, from exponential to polynomial in the search depth. We develop a new method, called ffl…
Cited by 11 (3 self) – Add To MetaCart

Well out of reach: Why hard problems are hard
by Joseph Culberson And, Joseph Culberson, Ian P. Gent — 1999 — APES Research Group
… transition from polynomial to exponential average search cost [8]. In general, graph coloring is the problem…
Add To MetaCart

Synthesizing Optimal Lower Dimensional Processor Arrays
by Kumar N. Ganapathy, Benjamin W. Wah — 1992 — Proceedings of International Conference on Parallel Processing, Pennsylvania State
… polynomial search space. In contrast, previous attempts [2, 3] do not guarantee the optimality…
Cited by 11 (8 self) – Add To MetaCart

Investigations of Model-Preference Defaults
by Mark Boddy, Robert P. Goldman, Keiji Kanazawa, Lynn Andrea Stein — 1989
…. They show that for general MPD axiomatizations this search problem is NP-hard. They describe a polynomial…
Add To MetaCart

Polynomials with small Mahler measure
by Michael J. Mossinghoff — 1998 — Math. Comp
…-5718(98)01006-0 POLYNOMIALS WITH SMALL MAHLER MEASURE MICHAEL J. MOSSINGHOFF Abstract. We describe several searches…
Cited by 9 (2 self) – Add To MetaCart

An Efficient BDD-Based A* Algorithm
by Rune M. Jensen, Randal E. Bryant, Al E. Bryant, Manuela M. Veloso — 2002 — In AIPS-02 Workshop on Planning via Model Checking
…. The reason is that the search fringe grows only polynomially with the search depth. As is often observed both…
Cited by 1 (0 self) – Add To MetaCart

New Polynomial Classes for Logic-Based Abduction
by Bruno Zanuttini — 2003
… problems are known to be 5 Bruno Zanuttini polynomial for the search for explanations. As far as we know…
Cited by 8 (3 self) – Add To MetaCart

Factorization of a 512-bit RSA modulus
by S. Cavallar, W. M. Lioen, H. J. J. Te Riele, B. Dodson, A. K. Lenstra, P. L. Montgomery, B. Murphy Et Al, Mathematisch Centrum (smc, The Dutch Foundation, Stefania Cavallar, Walter Lioen, Herman Te Riele, Bruce Dodson, Arjen K. Lenstra, Peter L. Montgomery, Brian Murphy, Karen Aardal, Je Gilchrist, Gerard Guillerm — 2000 — Proceedings of Eurocrypt '2000
… amount of CPU time for NFS. However, there is a trade-o between polynomial search time and sieve time…
Cited by 16 (3 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB