1204 search results - page 111 / 241 » Termination of Polynomial Programs |
94
Voted
IMAGING
2003
15 years 2 months ago
2003
An interactive program has been developed to assist in the design of new goniochromatic colors. The program gives the user a unique set of controls over a second order polynomial ...
100
click to vote
ICML
1996
IEEE
16 years 1 months ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
CP
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
92
Voted
COCO
1995
Springer
15 years 4 months ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
CASES
2005
ACM
15 years 2 months ago
2005
ACM
Due to resource and power constraints, embedded processors often cannot afford dedicated floating-point units. For instance, the IBM PowerPC processor embedded in Xilinx Virtex-...