138 search results - page 19 / 28 » The Complexity of Quickly ORM-Decidable Sets |
CEC
2010
IEEE
2010
IEEE
A binary Particle Swarm Optimization approach to fault diagnosis in parallel and distributed systems
14 years 8 months ago
— The efficient diagnosis of hardware and software faults in parallel and distributed systems remains a challenge in today’s most prolific decentralized environments. System-...
96
Voted
FMSB
2008
14 years 11 months ago
2008
Rule-based modelling is particularly effective for handling the highly combinatorial aspects of cellular signalling. The dynamics is described in terms of interactions between part...
102
click to vote
VLDB
2005
ACM
15 years 2 months ago
2005
ACM
Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much mor...
82
Voted
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
Computational science is placing new demands on optimization algorithms as the size of data sets and the computational complexity of scientific models continue to increase. As thes...
179
click to vote
ICDE
2007
IEEE
15 years 10 months ago
2007
IEEE
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...