Sciweavers

3218 search results - page 145 / 644
» Timed Extensions for SDL
Sort
View
TIME
2006
IEEE
15 years 10 months ago
Ultimately Periodic Simple Temporal Problems (UPSTPs)
In this paper, we consider quantitative temporal or spatial constraint networks whose constraints evolve over time in an ultimately periodic fashion. These constraint networks are...
Jean-François Condotta, Gérard Ligoz...
ISMIR
2005
Springer
156views Music» more  ISMIR 2005»
15 years 10 months ago
Content-Based Music Information Retrieval in Wireless Ad-Hoc Networks
This paper, introduces the application of Content-Based Music Information Retrieval (CBMIR) in wireless ad-hoc networks. We investigate for the first time the challenges posed by...
Ioannis Karydis, Alexandros Nanopoulos, Apostolos ...
FFA
2010
70views more  FFA 2010»
15 years 1 months ago
Fast arithmetic in unramified p-adic fields
Let p be prime and Zpn a degree n unramified extension of the ring of p-adic integers Zp. In this paper we give an overview of some very fast deterministic algorithms for common o...
Hendrik Hubrechts
131
Voted
DCC
2008
IEEE
16 years 4 months ago
Coprimitive sets and inextendable codes
Complete (n, r)-arcs in PG(k - 1, q) and projective (n, k, n - r)q-codes that admit no projective extensions are equivalent objects. We show that projective codes of reasonable le...
T. L. Alderson, Aiden A. Bruen
ICRA
2007
IEEE
144views Robotics» more  ICRA 2007»
15 years 11 months ago
Particle RRT for Path Planning with Uncertainty
— This paper describes a new extension to the Rapidly–exploring Random Tree (RRT) path planning algorithm. The Particle RRT algorithm explicitly considers uncertainty in its do...
Nik A. Melchior, Reid G. Simmons