Sciweavers

6455 search results - page 301 / 1291
» Research problems
Sort
View
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
13 years 9 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
ICSEA
2007
IEEE
16 years 29 days ago
An Integrated Database Programming and Querying Language with Support for Simultaneous Processing
The integration of query languages and programming languages is still a central problem of database research. In particular, issues with respect to the impedance mismatch are of i...
Markus Kirchberg
ECSQARU
2007
Springer
16 years 24 days ago
An Algorithm for Computing Inconsistency Measurement by Paraconsistent Semantics
Measuring inconsistency in knowledge bases has been recognized as an important problem in many research areas. Most of approaches proposed for measuring inconsistency are based on ...
Yue Ma, Guilin Qi, Pascal Hitzler, Zuoquan Lin
ISSS
1997
IEEE
107views Hardware» more  ISSS 1997»
15 years 10 months ago
Port Calling: A Transformation for Reducing I/O during Multi-Package Functional Partitioning
Partitioning a system among multiple input and output pin I O limited packages is a widely researched and hard to solve problem. We previously described a new approach yielding ...
Frank Vahid
AIPS
2006
15 years 8 months ago
Probabilistic Planning with Nonlinear Utility Functions
Researchers often express probabilistic planning problems as Markov decision process models and then maximize the expected total reward. However, it is often rational to maximize ...
Yaxin Liu, Sven Koenig