Sciweavers

50808 search results - page 118 / 10162
» A New
Sort
View
COMBINATORICS
2004
103views more  COMBINATORICS 2004»
13 years 8 months ago
On the Counting of Fully Packed Loop Configurations: Some New Conjectures
New conjectures are proposed on the numbers of FPL configurations pertaining to certain types of link patterns. Making use of the Razumov and Stroganov Ansatz, these conjectures a...
Jean-Bernard Zuber
AUTOMATICA
2000
100views more  AUTOMATICA 2000»
13 years 8 months ago
A new stability analysis of switched systems
In this paper, we present a new stability analysis of switched systems. We introduce the concepts of minimum/maximum holding time and redundancy as a tool for Lyapunov stability. ...
S.-H. Lee, T.-H. Kim, J.-T. Lim
JAL
2000
82views more  JAL 2000»
13 years 8 months ago
New Upper Bounds for Maximum Satisfiability
The (unweighted) Maximum Satisfiability problem (MaxSat) is: given a boolean formula in conjunctive normal form, find a truth assignment that satisfies the most number of clauses....
Rolf Niedermeier, Peter Rossmanith
NDJFL
2000
74views more  NDJFL 2000»
13 years 8 months ago
Frege's New Science
In this paper, we explore Fregean metatheory, what Frege called the New Science. The New Science arises in the context of Frege's debate with Hilbert over independence proofs ...
Aldo Antonelli, Robert May
JAMDS
2002
155views more  JAMDS 2002»
13 years 8 months ago
A new heuristic for the quadratic assignment problem
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short comp...
Zvi Drezner
« Prev « First page 118 / 10162 Last » Next »