Sciweavers

18306 search results - page 350 / 3662
» Algorithmics in Exponential Time
Sort
View
SIGACT
1998
105views more  SIGACT 1998»
15 years 6 months ago
Everything you wanted to know about the running time of Mergesort but were afraid to ask
Although mergesort is an algorithm that is frequently glossed over in textbooks, it provides fertile ground for planting ideas about algorithm analysis in the minds of students. A...
Ian Parberry
DATE
2003
IEEE
87views Hardware» more  DATE 2003»
16 years 3 days ago
A Novel, Low-Cost Algorithm for Sequentially Untestable Fault Identification
This paper presents a new and low-cost approach for identifying sequentially untestable faults. Unlike the single fault theorem, where the stuck-at fault is injected only in the r...
Manan Syal, Michael S. Hsiao
TRANSCI
2010
169views more  TRANSCI 2010»
15 years 1 months ago
A Model and Algorithm for the Courier Delivery Problem with Uncertainty
We consider the Courier Delivery Problem, a variant of the Vehicle Routing Problem with time windows in which customers appear probabilistically and their service times are uncert...
Ilgaz Sungur, Yingtao Ren, Fernando Ordó&nt...
ICANN
2005
Springer
16 years 10 days ago
A Neural Network Model for Inter-problem Adaptive Online Time Allocation
One aim of Meta-learning techniques is to minimize the time needed for problem solving, and the effort of parameter hand-tuning, by automating algorithm selection. The predictive m...
Matteo Gagliolo, Jürgen Schmidhuber
ALGORITHMICA
2006
103views more  ALGORITHMICA 2006»
15 years 6 months ago
Recognizing Hole-Free 4-Map Graphs in Cubic Time
We present a cubic-time algorithm for the following problem: Given a simple graph, decide whether it is realized by adjacencies of countries in a map without holes, in which at mo...
Zhi-Zhong Chen, Michelangelo Grigni, Christos H. P...