5263 search results - page 1029 / 1053 » Open Constraint Optimization |
108
click to vote
ATVA
2004
Springer
15 years 5 months ago
2004
Springer
Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, ...
CRYPTO
2004
Springer
15 years 5 months ago
2004
Springer
The most common method for computing exponentiation of random elements in Abelian groups are sliding window schemes, which enhance the efficiency of the binary method at the expens...
103
click to vote
ICALP
2004
Springer
15 years 5 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
IMR
2004
Springer
15 years 5 months ago
2004
Springer
A great challenge for flow simulators of new generation is to gain more accuracy at well proximity within complex geological structures. For this purpose, a new approach based on...
101
click to vote
IPSN
2004
Springer
15 years 5 months ago
2004
Springer
Due to constraints in cost, power, and communication, losses often arise in large sensor networks. The sensor can be modeled as an output of a linear stochastic system with random...