2107 search results - page 48 / 422 » Computing Small Search Numbers in Linear Time |
ACL
1990
13 years 9 months ago
1990
This paper describes a new hardware algorithm for morpheme extraction and its implementation on a specific machine (MEX-I), as the first step toward achieving natural language par...
ICPP
1998
IEEE
13 years 12 months ago
1998
IEEE
The crew planning problem has been successfully solved on a loosely connected network of workstations (NOW) using advanced computational techniques and efficient communication pat...
CSB
2005
IEEE
14 years 1 months ago
2005
IEEE
We have previously developed a method [1] for the inverse design of small ligands. This method can be used to design novel compounds with optimized properties (such as drugs) and ...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
MP
2011
12 years 10 months ago
2011
We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an 2-penalty functi...