Sciweavers

1389 search results - page 51 / 278
» Definability as hypercomputational effect
Sort
View
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 1 months ago
Complexity of Data Flow Analysis for Non-Separable Frameworks
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
Bageshri Karkare, Uday P. Khedker
TCS
2008
15 years 1 months ago
A timed semantics of Orc
Orc is a kernel language for structured concurrent programming. Orc provides three powerful combinators that define the structure of a concurrent computation. These combinators su...
Ian Wehrman, David Kitchin, William R. Cook, Jayad...
VLSISP
2002
114views more  VLSISP 2002»
15 years 1 months ago
Image processing using cellular neural networks based on multi-valued and universal binary neurons
Multi-valued and universal binary neurons (MVN and UBN) are the neural processing elements with the complex-valued weights and high functionality. It is possible to implement an a...
Igor N. Aizenberg, Constantine Butakoff
IAJIT
2010
133views more  IAJIT 2010»
15 years 16 hour ago
Improving web services security models
: Web services are considered one of the main technologies which emerged in recent years, they provide an application integration technology that allows business applications to co...
Sawsan Abu-Taleb, Hossam Mustafa
KI
2002
Springer
15 years 1 months ago
Integrating Function Application in State-Based Planning
We present an extension of state-based planning from traditional Strips to function application, allowing to express operator effects as updates. As proposed in PDDL, fluent variab...
Ute Schmid, Marina Müller, Fritz Wysotzki