Sciweavers

585 search results - page 89 / 117
» Better Abstractions for Timed Automata
Sort
View
ASPDAC
2005
ACM
120views Hardware» more  ASPDAC 2005»
14 years 11 months ago
STACCATO: disjoint support decompositions from BDDs through symbolic kernels
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...
Stephen Plaza, Valeria Bertacco
ATAL
2005
Springer
14 years 11 months ago
Automated resource-driven mission phasing techniques for constrained agents
A constrained agent is limited in the actions that it can take at any given time, and a challenging problem is to design policies for such agents to do the best they can despite t...
Jianhui Wu, Edmund H. Durfee
CEC
2005
IEEE
14 years 11 months ago
Multi-objective optimisation of the pump scheduling problem using SPEA2
Abstract- Significant operational cost and energy savings can be achieved by optimising the schedules of pumps, which pump water from source reservoirs to storage tanks, in Water ...
Manuel López-Ibáñez, T. Devi ...
86
Voted
COCOON
2008
Springer
14 years 11 months ago
Quasi-bicliques: Complexity and Binding Pairs
Abstract. Protein-protein interactions (PPIs) are one of the most important mechanisms in cellular processes. To model protein interaction sites, recent studies have suggested to f...
Xiaowen Liu, Jinyan Li, Lusheng Wang
CP
2008
Springer
14 years 11 months ago
Cost-Based Domain Filtering for Stochastic Constraint Programming
Abstract. Cost-based filtering is a novel approach that combines techniques from Operations Research and Constraint Programming to filter from decision variable domains values that...
Roberto Rossi, Armagan Tarim, Brahim Hnich, Steven...