Sciweavers

9997 search results - page 1595 / 2000
» The case for crowd computing
Sort
View
ESOP
2009
Springer
15 years 10 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
ICALP
2007
Springer
15 years 10 months ago
In-Place Suffix Sorting
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
Gianni Franceschini, S. Muthukrishnan
GECCO
2009
Springer
15 years 10 months ago
Evolving heuristically difficult instances of combinatorial problems
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
Bryant A. Julstrom
3DPVT
2004
IEEE
101views Visualization» more  3DPVT 2004»
15 years 10 months ago
A Unified Approach for Motion Analysis and View Synthesis
Image based rendering (IBR) consists of several steps: (i) Calibration (or ego-motion computation) of all input images. (ii) Determination of regions in the input images used to s...
Alex Rav-Acha, Shmuel Peleg
AI
2006
Springer
15 years 10 months ago
Partial Local FriendQ Multiagent Learning: Application to Team Automobile Coordination Problem
Real world multiagent coordination problems are important issues for reinforcement learning techniques. In general, these problems are partially observable and this characteristic ...
Julien Laumonier, Brahim Chaib-draa
« Prev « First page 1595 / 2000 Last » Next »