Sciweavers

241 search results - page 7 / 49
» Four Paths to AI
Sort
View
94
Voted
JASIS
2000
76views more  JASIS 2000»
14 years 11 months ago
Guided paths through Web-based collections: Design, experiences, and adaptations
Digital libraries need to facilitate the use of digital information in a variety of settings. One approach to making information useful is to enable its application to situations ...
Frank M. Shipman III, Richard Furuta, Donald Brenn...
102
Voted
AI
2010
Springer
15 years 4 months ago
On Multi-robot Area Coverage
Area coverage is one of the emerging problems in multi-robot coordination. In this task a team of robots is cooperatively trying to observe or sweep an entire area, possibly conta...
Pooyan Fazli
ICRA
2009
IEEE
119views Robotics» more  ICRA 2009»
15 years 6 months ago
Survivability: Measuring and ensuring path diversity
— A novel criterion is introduced for assessing the diversity of a collection of paths or trajectories. The main idea is the notion of survivability, which measures the likelihoo...
Lawrence H. Erickson, Steven M. LaValle
81
Voted
TABLETOP
2007
IEEE
15 years 6 months ago
Improving Menu Interaction for Cluttered Tabletop Setups with User-Drawn Path Menus
Many digital tabletop systems have a graphical user interface (GUI) that features context (or pop-up) menus. While linear and pie menus are commonly used for direct pen and touch ...
Daniel Leithinger, Michael Haller
SMC
2010
IEEE
158views Control Systems» more  SMC 2010»
14 years 9 months ago
A study of genetic algorithms for approximating the longest path in generic graphs
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
David Portugal, Carlos Henggeler Antunes, Rui Roch...