Sciweavers

2663 search results - page 531 / 533
» How to Choose a Timing Model
Sort
View
AROBOTS
2007
159views more  AROBOTS 2007»
13 years 7 months ago
Structure-based color learning on a mobile robot under changing illumination
— A central goal of robotics and AI is to be able to deploy an agent to act autonomously in the real world over an extended period of time. To operate in the real world, autonomo...
Mohan Sridharan, Peter Stone
DAM
2010
112views more  DAM 2010»
13 years 7 months ago
New results on optimizing rooted triplets consistency
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
AI
2000
Springer
13 years 7 months ago
Wrapper induction: Efficiency and expressiveness
The Internet presents numerous sources of useful information--telephone directories, product catalogs, stock quotes, event listings, etc. Recently, many systems have been built th...
Nicholas Kushmerick
VLDB
2002
ACM
143views Database» more  VLDB 2002»
13 years 7 months ago
SQL Memory Management in Oracle9i
Complex database queries require the use of memory-intensive operators like sort and hashjoin. Those operators need memory, also referred to as SQL memory, to process their input ...
Benoît Dageville, Mohamed Zaït
QUESTA
2007
136views more  QUESTA 2007»
13 years 7 months ago
A resource allocation queueing fairness measure: properties and bounds
Fairness is an inherent and fundamental factor of queue service disciplines in a large variety of queueing applications, ranging from airport and supermarket waiting lines to comp...
Benjamin Avi-Itzhak, Hanoch Levy, David Raz