922 search results - page 89 / 185 » Engineering a complex ontology with time |
148
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank ...
165
click to vote
SOCO
2008
Springer
15 years 6 months ago
2008
Springer
Data-centric business applications comprise an important class of distributed systems that includes on-line stores, document management systems, and patient portals. However, their...
290
click to vote
SEDE
2010
15 years 4 months ago
2010
Enterprise-level applications are becoming complex with the need for event and stream processing, multiple query processing and data analysis over heterogeneous data sources such ...
213
click to vote
SOCO
2012
Springer
14 years 2 months ago
2012
Springer
Abstract Population-based meta-heuristics are algorithms that can obtain very good results for complex continuous optimization problems in a reduced amount of time. These search al...
148
click to vote
KBSE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Decisions regarding the mapping of software components to hardware nodes affect the quality of the resulting system. Making these decisions is hard when considering the ...