837 search results - page 25 / 168 » Hard combinators |
95
Voted
AAAI
2000
14 years 11 months ago
2000
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
86
Voted
ANOR
2004
14 years 10 months ago
2004
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
106
click to vote
GRID
2007
Springer
14 years 10 months ago
2007
Springer
Combining Grid and P2P technologies can be exploited to provide high-level data sharing in large-scale distributed environments. However, this combination must deal with two hard p...
ICCAD
2000
IEEE
15 years 2 months ago
2000
IEEE
A tool is presented that gives a high-level estimation of the power consumed by an analog continuous-time OTA-C filter when given only high-level input parameters such as dynamic ...
90
Voted
ACL
2003
14 years 11 months ago
2003
Kernel-based learning (e.g., Support Vector Machines) has been successfully applied to many hard problems in Natural Language Processing (NLP). In NLP, although feature combinatio...