Sciweavers

877 search results - page 63 / 176
» How to Cover a Grammar
Sort
View
105
Voted
MP
2010
116views more  MP 2010»
14 years 11 months ago
Separation algorithms for 0-1 knapsack polytopes
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
Konstantinos Kaparis, Adam N. Letchford
181
Voted

Book
417views
16 years 11 months ago
Eye, Brain, and Vision
"This book is mainly about the development of our ideas on how the brain handles visual information; it covers roughly the period between 1950 and 1980. Intuition tells us t...
David H. Hubel

Book
559views
16 years 10 months ago
Mixed Signal and DSP Design Techniques
"Mixed-Signal and DSP Design Techniques, edited by Walt Kester (Newnes, 2003) covers sampled data systems, choosing A-to-D and D-to-A converters for DSP applications, fast Fou...
Walt Kester
121
Voted
AGENTS
2001
Springer
15 years 5 months ago
Terrain coverage with ant robots: a simulation study
In this paper, we study a simple means for coordinating teams of simple agents. In particular, we study ant robots and how they can cover terrain once or repeatedly by leaving mar...
Sven Koenig, Yaxin Liu
ICLP
1997
Springer
15 years 4 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...