3637 search results - page 293 / 728 » On Dynamic Bit-Probe Complexity |
179
click to vote
ATVA
2008
Springer
15 years 8 months ago
2008
Springer
Classical verification often uses abstraction when dealing with data. On the other hand, dynamic XML-based applications have become pervasive, for instance with the ever growing im...
192
click to vote
APVIS
2010
15 years 8 months ago
2010
Understanding fluid flow is a difficult problem and of increasing importance as computational fluid dynamics produces an abundance of simulation data. Experimental flow analysis h...
158
click to vote
ICAI
2003
15 years 8 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
182
Voted
AAAI
1994
15 years 8 months ago
1994
1 User interface design and development for knowledgebased systems and most other types of applications is a resource-consuming activity. Thus, many attempts have been made to auto...
170
click to vote
HPCC
2010
Springer
15 years 7 months ago
2010
Springer
This paper presents an algorithm and a data structure for scalable dynamic synchronization in fine-grained parallelism. The algorithm supports the full generality of phasers with d...