Sciweavers

1809 search results - page 352 / 362
» Weakly Computable Real Numbers
Sort
View
ATAL
2008
Springer
13 years 10 months ago
Adaptive multi-robot wide-area exploration and mapping
The exploration problem is a central issue in mobile robotics. A complete terrain coverage is not practical if the environment is large with only a few small hotspots. This paper ...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla
CASES
2008
ACM
13 years 10 months ago
Efficiency and scalability of barrier synchronization on NoC based many-core architectures
Interconnects based on Networks-on-Chip are an appealing solution to address future microprocessor designs where, very likely, hundreds of cores will be connected on a single chip...
Oreste Villa, Gianluca Palermo, Cristina Silvano
CIKM
2006
Springer
13 years 10 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
COMPGEOM
2005
ACM
13 years 10 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
CSCLP
2008
Springer
13 years 10 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul