Sciweavers

158 search results - page 25 / 32
» The Cover Time, the Blanket Time, and the Matthews Bound
Sort
View
PDCN
2004
13 years 10 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
JIT
2004
Springer
204views Database» more  JIT 2004»
14 years 1 months ago
Ercatons: Thing-Oriented Programming
Thing-oriented programming (TP) is an emerging programming model which overcomes some of the limitations of current practice in software development in general and of object-orient...
Oliver Imbusch, Falk Langhammer, Guido von Walter
ICDE
2007
IEEE
109views Database» more  ICDE 2007»
14 years 10 months ago
Evaluating Proximity Relations Under Uncertainty
For location-based services it is often essential to efficiently process proximity relations among mobile objects, such as to establish whether a group of friends or family member...
Zhengdao Xu, Hans-Arno Jacobsen
ICSE
2008
IEEE-ACM
14 years 9 months ago
Time-bounded adaptation for automotive system software
Software is increasingly deployed in vehicles as demand for new functionality increases and cheaper and more powerful hardware becomes available. Likewise, emerging wireless commu...
Aline Senart, Douglas C. Schmidt, Serena Fritsch, ...
SIGMOD
2002
ACM
114views Database» more  SIGMOD 2002»
14 years 8 months ago
Time-parameterized queries in spatio-temporal databases
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...
Yufei Tao, Dimitris Papadias