10718 search results - page 589 / 2144 » On the Circuit Implementation Problem |
169
click to vote
BIBE
2006
IEEE
16 years 1 months ago
2006
IEEE
We consider the planted motif search problem, a problem that arises from the need to find transcription factor-binding sites in genomic information. One of the fastest non-exact a...
176
click to vote
ESA
2006
Springer
15 years 11 months ago
2006
Springer
We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize amplitude of the electrical current through the diodes whic...
173
click to vote
EVOW
2006
Springer
15 years 11 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
145
click to vote
ANLP
2000
15 years 8 months ago
2000
Customer care in technical domains is increasingly based on e-mail communication, allowing for the reproduction of approved solutions. Identifying the customer's problem is o...
169
click to vote
AAAI
1994
15 years 8 months ago
1994
This paper conjectures a computational account of how children might learn the meanings of words in their native language. First, a simplified version of the lexical acquisition t...