Sciweavers

1100 search results - page 147 / 220
» An Approach to Test Aspect-oriented Programs
Sort
View
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
15 years 7 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
CSR
2008
Springer
15 years 4 months ago
Comparing Universal Covers in Polynomial Time
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
Jirí Fiala, Daniël Paulusma
ICWS
2010
IEEE
15 years 4 months ago
Script-Based Generation of Dynamic Testbeds for SOA
This paper addresses one of the major problems of SOA software development: the lack of support for testing complex service-oriented systems. The research community has developed v...
Lukasz Juszczyk, Schahram Dustdar
CODES
2006
IEEE
15 years 9 months ago
Hardware assisted pre-emptive control flow checking for embedded processors to improve reliability
Reliability in embedded processors can be improved by control flow checking and such checking can be conducted using software or hardware. Proposed software-only approaches suffe...
Roshan G. Ragel, Sri Parameswaran
CEC
2007
IEEE
15 years 7 months ago
Virtual reality high dimensional objective spaces for multi-objective optimization: An improved representation
This paper presents an approach for constructing improved visual representations of high dimensional objective spaces using virtual reality. These spaces arise from the solution of...
Julio J. Valdés, Alan J. Barton, Robert Orc...