Sciweavers

9842 search results - page 1911 / 1969
» Problem complexity
Sort
View
DATE
2004
IEEE
119views Hardware» more  DATE 2004»
14 years 2 months ago
MINCE: Matching INstructions Using Combinational Equivalence for Extensible Processor
Designing custom-extensible instructions for Extensible Processors1 is a computationally complex task because of the large design space. The task of automatically matching candida...
Newton Cheung, Sri Parameswaran, Jörg Henkel,...
CASC
2006
Springer
128views Mathematics» more  CASC 2006»
14 years 2 months ago
New Domains for Applied Quantifier Elimination
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
Thomas Sturm
CEAS
2006
Springer
14 years 2 months ago
Fast Uncertainty Sampling for Labeling Large E-mail Corpora
One of the biggest challenges in building effective anti-spam solutions is designing systems to defend against the everevolving bag of tricks spammers use to defeat them. Because ...
Richard Segal, Ted Markowitz, William Arnold
EELC
2006
125views Languages» more  EELC 2006»
14 years 2 months ago
How Do Children Develop Syntactic Representations from What They Hear?
nstructional schemas, both specific and abstract. Children are thought to start out with concrete pieces of language and to gradually develop more schematic constructions. All cons...
Elena Lieven
FASE
2006
Springer
14 years 2 months ago
: Designing a Scalable Build Process
Modern software codebases are frequently large, heterogeneous, and constantly evolving. The languages and tools for software construction, including code builds and configuration m...
Jason Hickey, Aleksey Nogin
« Prev « First page 1911 / 1969 Last » Next »