5331 search results - page 336 / 1067 » Algebraic Methods for Optimization Problems |
153
click to vote
IIS
2004
15 years 8 months ago
2004
Search results clustering problem is defined as an automatic, on-line grouping of similar documents in a search results list returned from a search engine. In this paper we present...
159
click to vote
ARSCOM
2007
15 years 6 months ago
2007
A subset D of the vertex set V of a graph is called an open oddd dominating set if each vertex in V is adjacent to an odd number of vertices in D (adjacency is irreflexive). In t...
166
click to vote
CORR
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
176
click to vote
SPLC
2008
15 years 8 months ago
2008
Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...
166
click to vote
DATE
2007
IEEE
16 years 1 months ago
2007
IEEE
One of the main tasks in analog design is the sizing of the circuit parameters, such as transistor lengths and widths, in order to obtain optimal circuit performances, such as hig...