Sciweavers

10568 search results - page 1950 / 2114
» Computer Intelligence and Formalization
Sort
View
140
Voted
IOR
2007
106views more  IOR 2007»
15 years 3 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
146
Voted
JSYML
2007
100views more  JSYML 2007»
15 years 3 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore
148
Voted
WWW
2008
ACM
15 years 3 months ago
Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
Wilfred Ng, Ho Lam Lau, Aoying Zhou
135
Voted
BMCBI
2004
228views more  BMCBI 2004»
15 years 3 months ago
An XML standard for the dissemination of annotated 2D gel electrophoresis data complemented with mass spectrometry results
Background: Many proteomics initiatives require a seamless bioinformatics integration of a range of analytical steps between sample collection and systems modeling immediately ass...
Romesh Stanislaus, Liu Hong Jiang, Martha Swartz, ...
133
Voted
COGSCI
2004
148views more  COGSCI 2004»
15 years 3 months ago
Disfluencies, language comprehension, and Tree Adjoining Grammars
Disfluencies include editing terms such as uh and um as well as repeats and revisions. Little is known about how disfluencies are processed, and there has been next to no research...
Fernanda Ferreira, Ellen F. Lau, Karl G. D. Bailey
« Prev « First page 1950 / 2114 Last » Next »