Sciweavers

4940 search results - page 851 / 988
» On the Complexity of Universal Programs
Sort
View
GECCO
2000
Springer
168views Optimization» more  GECCO 2000»
15 years 10 months ago
A Fault-tolerant Multicast Routing Algorithm in ATM Networks
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
Sam Kwong, S. S. Chan
ISSTA
2000
ACM
15 years 9 months ago
Verifying properties of process definitions
ions for concise and precise specification of such control, but balance this with visualization support to help users also obtain intuitive insights. The underlying complexhese con...
Jamieson M. Cobleigh, Lori A. Clarke, Leon J. Oste...
KR
2000
Springer
15 years 9 months ago
Finding Admissible and Preferred Arguments Can be Very Hard
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
MIDDLEWARE
2000
Springer
15 years 9 months ago
The Design and Performance of a Scalable ORB Architecture for CORBA Asynchronous Messaging
Historically, method-oriented middleware, such as Sun RPC, DCE, Java RMI, COM, and CORBA, has provided synchronous method invocation (SMI) models to applications. Although SMI work...
Alexander B. Arulanthu, Carlos O'Ryan, Douglas C. ...
SPIN
2000
Springer
15 years 9 months ago
The Temporal Rover and the ATG Rover
The Temporal Rover is a specification based verification tool for applications written in C, C++, Java, Verilog and VHDL. The tool combines formal specification, using Linear-Time ...
Doron Drusinsky