Sciweavers

7619 search results - page 1419 / 1524
» Interaction, observance or both
Sort
View
AIPS
2011
13 years 1 months ago
Where Ignoring Delete Lists Works, Part II: Causal Graphs
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work (Hoffmann 2005), it was observed that the optimal relax...
Joerg Hoffmann
FGR
2011
IEEE
227views Biometrics» more  FGR 2011»
13 years 1 months ago
Warp that smile on your face: Optimal and smooth deformations for face recognition
— In this work, we present novel warping algorithms for full 2D pixel-grid deformations for face recognition. Due to high variation in face appearance, face recognition is consid...
Tobias Gass, Leonid Pishchulin, Philippe Dreuw, He...
IWMM
2011
Springer
245views Hardware» more  IWMM 2011»
13 years 29 days ago
Waste not, want not: resource-based garbage collection in a shared environment
To achieve optimal performance, garbage-collected applications must balance the sizes of their heaps dynamically. Sizing the heap too small can reduce throughput by increasing the...
Matthew Hertz, Stephen Kane, Elizabeth Keudel, Ton...
JAIR
2011
173views more  JAIR 2011»
13 years 29 days ago
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work, it was observed that the optimal relaxation heuristic ...
J. Hoffmann
POPL
2011
ACM
13 years 28 days ago
Dynamic inference of static types for ruby
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
Jong-hoon (David) An, Avik Chaudhuri, Jeffrey S. F...
« Prev « First page 1419 / 1524 Last » Next »