Sciweavers

2841 search results - page 58 / 569
» A Call to Order
Sort
View
FSTTCS
2008
Springer
14 years 11 months ago
Analyzing the Implicit Computational Complexity of object-oriented programs
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
Jean-Yves Marion, Romain Péchoux
DM
2010
124views more  DM 2010»
14 years 7 months ago
Perfect dodecagon quadrangle systems
A dodecagon quadrangle is the graph consisting of two cycles: a 12-cycle (x1, x2, ..., x12) and a 4-cycle (x1, x4, x7, x10). A dodecagon quadrangle system of order n and index [D...
Lucia Gionfriddo, Mario Gionfriddo
CVPR
2011
IEEE
14 years 5 months ago
Ordinal Hyperplanes Ranker with Cost Sensitivities for Age Estimation
In this paper, we propose an ordinal hyperplane ranking algorithm called OHRank, which estimates human ages via facial images. The design of the algorithm is based on the relative...
Kuang-Yu Chang, Chu-Song Chen, Yi-Ping Hung
DAM
2011
14 years 4 months ago
A General Label Search to investigate classical graph search algorithms
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...
Richard Krueger, Geneviève Simonet, Anne Be...
CISIS
2011
IEEE
13 years 9 months ago
Agent-based Pickup and Delivery Planning: The Learnable Evolution Model Approach
—The Dynamic Vehicle Routing Problem (DVRP) is an optimization problem in which agents deliver orders that are not known in advance to the routing. Partial solutions need to be a...
Janusz Wojtusiak, Tobias Warden, Otthein Herzog