Sciweavers

466 search results - page 84 / 94
» Preprocessing Search Spaces for Branch and Bound Search
Sort
View
151
Voted
SIGMOD
2006
ACM
149views Database» more  SIGMOD 2006»
15 years 9 months ago
Efficient query processing on unstructured tetrahedral meshes
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
Stratos Papadomanolakis, Anastassia Ailamaki, Juli...
CGF
2008
182views more  CGF 2008»
14 years 9 months ago
Lazy Solid Texture Synthesis
Existing solid texture synthesis algorithms generate a full volume of color content from a set of 2D example images. We introduce a new algorithm with the unique ability to restri...
Yue Dong, Sylvain Lefebvre, Xin Tong, George Drett...
84
Voted
BMCBI
2005
122views more  BMCBI 2005»
14 years 9 months ago
A neural strategy for the inference of SH3 domain-peptide interaction specificity
Background: The SH3 domain family is one of the most representative and widely studied cases of so-called Peptide Recognition Modules (PRM). The polyproline II motif PxxP that gen...
Enrico Ferraro, Allegra Via, Gabriele Ausiello, Ma...
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 2 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
COR
2010
123views more  COR 2010»
14 years 9 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...