Sciweavers

840 search results - page 72 / 168
» The Complexity of the Extended GCD Problem
Sort
View
MSV
2007
13 years 9 months ago
FMC-QE: A New Approach in Quantitative Modeling
Abstract—Service requests are the origin of every service provisioning process and therefore the entities to be considered first. Similar to Physics and Engineering Sciences, ser...
Werner Zorn
PODS
2010
ACM
197views Database» more  PODS 2010»
13 years 8 months ago
When data dependencies over SQL tables meet the logics of paradox and S-3
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
Sven Hartmann, Sebastian Link
AROBOTS
2004
119views more  AROBOTS 2004»
13 years 7 months ago
Swarm-Bot: A New Distributed Robotic Concept
The swarm intelligence paradigm has proven to have very interesting properties such as robustness, flexibility and ability to solve complex problems exploiting parallelism and self...
Francesco Mondada, Giovanni C. Pettinaro, Andr&eac...
CORR
2004
Springer
90views Education» more  CORR 2004»
13 years 7 months ago
Non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky
ECRTS
2009
IEEE
13 years 5 months ago
Precise Worst-Case Execution Time Analysis for Processors with Timing Anomalies
This paper explores timing anomalies in WCET analysis. Timing anomalies add to the complexity of WCET analysis and make it hard to apply divide-and-conquer strategies to simplify ...
Raimund Kirner, Albrecht Kadlec, Peter P. Puschner