Sciweavers

3653 search results - page 111 / 731
» On Recognizable Timed Languages
Sort
View
CGO
2011
IEEE
14 years 1 months ago
Language and compiler support for auto-tuning variable-accuracy algorithms
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
Jason Ansel, Yee Lok Wong, Cy P. Chan, Marek Olsze...
AOSD
2007
ACM
15 years 2 months ago
Using natural language program analysis to locate and understand action-oriented concerns
Most current software systems contain undocumented high-level ideas implemented across multiple files and modules. When developers perform program maintenance tasks, they often wa...
David Shepherd, Zachary P. Fry, Emily Hill, Lori L...
WEBDB
2005
Springer
132views Database» more  WEBDB 2005»
15 years 3 months ago
On the role of composition in XQuery
Nonrecursive XQuery is known to be hard for nondeterministic exponential time. Thus it is commonly believed that any algorithm for evaluating XQuery has to require exponential amo...
Christoph Koch
ENTCS
2008
142views more  ENTCS 2008»
14 years 10 months ago
Worst Case Reaction Time Analysis of Concurrent Reactive Programs
Reactive programs have to react continuously to their inputs. Here the time needed to react with the according output is important. While the synchrony hypothesis takes the view t...
Marian Boldt, Claus Traulsen, Reinhard von Hanxled...
WWW
2002
ACM
15 years 10 months ago
Multimedia meets computer graphics in SMIL2.0: a time model for the web
Multimedia scheduling models provide a rich variety of tools for managing the synchronization of media like video and audio, but generally have an inflexible model for time itself...
Patrick Schmitz