Sciweavers

2200 search results - page 337 / 440
» Bloch's Constant is Computable
Sort
View
WAE
1998
118views Algorithms» more  WAE 1998»
15 years 7 months ago
Guarding Scenes against Invasive Hypercubes
In recent years realistic input models for geometric algorithms have been studied. The most important models introduced are fatness, low density, unclutteredness, and small simple...
Mark de Berg, Haggai David, Matthew J. Katz, Mark ...
AAAI
1994
15 years 7 months ago
CHATTERBOTS, TINYMUDS, and the Turing Test: Entering the Loebner Prize Competition
The Turing Test was proposed by Alan Turing in 1950; he called it the Imitation Game. In 1991 Hu Loebner prize competition, offering a f h Loebner started the 100,000 prize to the...
Michael L. Mauldin
WCE
2007
15 years 7 months ago
Comparison of Optimum and Square Blanks Using the Sensitivity Approach
—This paper studies the modified sensitivity analysis applied into an elastic-plastic finite element analysis of a 3D blank design in sheet metal forming. Originally the sensitiv...
F. R. Biglari, A. Agahi, O. Nikfarjam, B. M. Daria...
AIPS
2009
15 years 7 months ago
Structural-Pattern Databases
abstraction heuristics, notably pattern-database and merge-and-shrink heuristics, are employed by some state-ofthe-art optimal heuristic-search planners. The major limitation of t...
Michael Katz, Carmel Domshlak
DEXA
2010
Springer
213views Database» more  DEXA 2010»
15 years 7 months ago
Efficient K-Nearest Neighbor Search in Time-Dependent Spatial Networks
The class of k Nearest Neighbor (kNN) queries in spatial networks has been widely studied in the literature. All existing approaches for kNN search in spatial networks assume that ...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...