The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.

## Filters

##
###
Page 4213 of Mathematical Reviews Vol. , Issue 99f
[page]

1999
*
Mathematical Reviews
*

In

*the*present paper, it is shown that more general*classes**of**PNS*-*problems*can also be*reformulated**as**set**covering**problems*. ... (H-VESZ-C; Veszprém)*On**the*formulation*of**some**classes**of**PNS*-*problems**as**set**covering**problems*. (English summary) Acta Cybernet. 13 (1998), no. 3, 329-337. ...##
###
Adjustable Regret for Continuous Control of Conservatism and Competitive Ratio Analysis
[article]

2022
*
arXiv
*
pre-print

robust optimization

arXiv:2105.05536v2
fatcat:5dadfws2b5h3vooj6ffgcvxbcu
*problems*, so*as*to take advantage*of**the*tractable solution schemes and theoretical results developed recently. ... Finally,*the*new criterion is applied to*the*well studied robust*one*-way trading*problem*to demonstrate its potential. ... this*class**of**problems*. • Meanwhile, ARM formulations have good structural properties and may even produce closed-form solutions to*some**problems*. ...##
###
Semantic Transportation Prototypical Network for Few-Shot Intent Detection

2021
*
Conference of the International Speech Communication Association
*

Existing state-

doi:10.21437/interspeech.2021-548
dblp:conf/interspeech/XuZYZ21
fatcat:zqxtfj56wbcbxbd4gz3tjdi4ue
*of*-*the*-art few-shot model, Prototypical Network (*PN*), mainly focus*on*computing*the*similarity between examples in a metric space by leveraging sentence-level instance representations. ... Few-shot intent detection is a*problem*that only a few annotated examples are available for unseen intents, and deep models could suffer from*the*overfitting*problem*because*of*scarce data. ... In general, these few annotated data consist*of*support*set*Dsupport, and a query*set*Dquery is also included to test*the*accuracy*of**the*classifier*on*new*classes*. ...##
###
Correlated itemset mining in ROC space

2009
*
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '09
*

*on*

*the*convex hull in ROC space. ...

*The*algorithm does not depend

*on*a minimal frequency threshold and is shown to outperform several alternative approaches by orders

*of*magnitude, both in runtime and in memory requirements. ... We are grateful to Albrecht Zimmermann for discussions, and to Hong Cheng for providing

*the*implementation

*of*DDPMine. ...

##
###
Learning to Reformulate for Linear Programming
[article]

2022
*
arXiv
*
pre-print

It has been verified that

arXiv:2201.06216v1
fatcat:uoqmfnyovbbxjm37jcmzwxn6fe
*the*linear programming (LP) is able to formulate many real-life optimization*problems*, which can obtain*the*optimum by resorting to corresponding solvers such*as*OptVerse, Gurobi ... In this paper, we are*the*first to propose a reinforcement learning-based*reformulation*method for LP to improve*the*performance*of*solving process. ... Hull*problem*,*Set**Cover**problem*, etc. play a fundamental Table 1 : 1 Statistical description*of*used dataset Cumulative distribution function 0.0 0.2 0.4 0.6 0.8 1.0 0.5 0.6 0.7 Ratio*of**reformulate*...##
###
Around the Danzer Problem and the Construction of Dense Forests
[article]

2021
*
arXiv
*
pre-print

A 1965

arXiv:2010.06756v4
fatcat:lrcit7xfv5cclee7276zbig2ku
*problem*due to Danzer asks whether there exists a*set*with finite density in Euclidean space intersecting any convex body*of*volume*one*. ...*The*goal*of*this paper is to survey*the*known results related to*the*Danzer*Problem*and to*the*construction*of*dense forests, to generalise*some**of*them and to state a number*of*open*problems*to make further ... This leaves open*the*following question :*Problem*30. Assume that*the**set**of*holonomy vectors*of*a translation surface is relatively dense. Can it be a dense forest? ...##
###
Page 7929 of Mathematical Reviews Vol. , Issue 2000k
[page]

2000
*
Mathematical Reviews
*

Results: Let E be a bounded closed Cantor

*set**on**the*real line which can be expressed*as*[bo, ao] \ Uj, (a;,5;). ...*the*group*of*unimodular characters*of**the*fundamental group*of*C\E and*the*Abel mapping is defined*as*a character*of**some*function called*the*“canonical product”. ...##
###
Page 2272 of Mathematical Reviews Vol. , Issue 87e
[page]

1987
*
Mathematical Reviews
*

It is noted here that

*the**classes*Po, P;, ---*of*complements*of*Up, U;,--- are II?-*classes*with ,,*Pn*= NAP (*the**class**of*all NAP*sets*). Next, various results are developed about NAP. ...*The*author shows that this*set*is L$-complete and so solves*the**problem*.*The*heart*of**the*proof is that by using his characterization*of*L$-*sets*from an earlier paper [J. ...##
###
A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations

1987
*
Reserche operationelle
*

Hansen is gratefully acknowledged for stimulating discussions

doi:10.1051/ro/1987210201051
fatcat:4sucb5cvfrfezibtkw3p67azw4
*on**some**of**the**problems*studied hère, and, in particular,*the*new center-sum*problem*. ... Thanks are also due to an anonymous référée for a number*of*constructive remarks. ... INTRODUCTION*The*purpose*of*this paper is to exhibit and study a large*class**of*combinatorial optimization*problems*, ail*of*which enjoy*the*following nice properties: (i) they can be*reformulated**as*very ...##
###
Monte Carlo Algorithms for Optimal Stopping and Statistical Learning
[article]

2004
*
arXiv
*
pre-print

We

arXiv:math/0408276v1
fatcat:vy2pwjxvubhl5o7tw5mxmcf7na
*reformulate**the*optimal stopping*problem*for Markov processes in discrete time*as*a generalized statistical learning*problem*. ... We extend*the*Longstaff-Schwartz algorithm for approximately solving optimal stopping*problems**on*high-dimensional state spaces. ... L 1 -*covering*numbers N (ε, L t (H), d 1,*Pn*)*of**the*centered loss*class*. ...##
###
Beyond the Valley of the Covariance Function

2015
*
Statistical Science
*

Discussion

doi:10.1214/15-sts515
fatcat:623gkznhrreyjlsjmryasf7rdq
*of*"Cross-Covariance Functions for Multivariate Geostatistics" by Genton and Kleiber [arXiv:1507.08017]. ...*The*SPDE approach introduced by Lindgren, Rue and Lindström (2011)*as*a computationally efficient*reformulation**of*GRFs is an example*of**the*same procedure where we never construct*the*kernel matrix. ... This also compares well with non-Markovian methods, such*as**the*aforementioned n-dimensional convolution kernel methods that have computational cost*of*O(*pn*2 N + p 3 n 3 ). ...##
###
Page 802 of Mathematical Reviews Vol. , Issue 83b
[page]

1983
*
Mathematical Reviews
*

*The*advantage

*of*this

*reformulation*is that

*some*

*of*

*the*quantum logic postulates such

*as*completeness, atomicity, and

*the*

*covering*law become more physically transparent. ...

*The*authors consider

*the*discrete matrix Schrédinger equation

*Pn*—1 + BiPn +A nPn+ 1 =AP,p» Where || A,,—J|| and || B,|| tend to zero

*as*|n|—> 00,

*as*

*the*inverse scattering

*problem*for a

*class*

*of*nonlinear ...

##
###
Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems

1990
*
Discrete Applied Mathematics
*

We show in this paper that by

doi:10.1016/0166-218x(90)90144-2
fatcat:tvvf6xlvlbgtblbxgqys5atxhe
*reformulating**the*conditions defining deadlocks (respectively traps, pee's) in terms*of*logic programming*problems*featuring*the*special structure known*as*Hornsatisfiability ... Many known results from*the*literature state necessary and/or sufficient conditions for liveness or boundedness in terms*of*structural properties, for nets with particular valuations*on**the*arcs. ...*As*an illustration,*the*incidence matrix*of**the**PN*shown*on*Fig. 1 is: t1 t2 t3 Pl -1 -1 +2 p2 +l -2 0 P3 i 1 -1 +2 -1 Let M be an initial*set**of*marks. ...##
###
Prediction of enzyme classification from protein sequence without the use of sequence similarity

1997
*
Proceedings. International Conference on Intelligent Systems for Molecular Biology
*

We also explored

pmid:9322021
fatcat:ft7y5axhejh5nie7tyupnrtn44
*the*use*of*several different feature*sets*. ...*as*: Is*the*protein an enzyme? ... Acknowledgments This work was supported by SRI International and by*the*Human Frontiers Science Program. ...##
###
Incremental Integer Linear Programming Models for Petri Nets Reachability Problems
[chapter]

2008
*
Petri Net, Theory and Applications
*

Indeed, in

doi:10.5772/5327
fatcat:33z4ueds6jdfblozinbqhwvcn4
*the*context*of*unbounded*PNs*,*the*value*of*max k is*set*arbitrarily,*as*we do not know any information*on**the*number*of*steps needed to find a possible solution. ...*the*original, based*on**some*properties to preserve: symmetries (Huber et al., 1985) , reductions (Berthelot, 1986) and partial order (*covering*step graphs (Vernadat et al., 1996) , stubborn*sets*www.intechopen.com ...*The*natural way in which Petri nets allow*one*to formally capture many*of**the*basic notions and issues*of*concurrent systems has contributed greatly to*the*development*of*a rich theory*of*concurrent systems ...
« Previous

*Showing results 1 — 15 out of 4,889 results*